23 pages matching possible in this book
Results 1-3 of 23
What people are saying - Write a review
We haven't found any reviews in the usual places.
Experimenting on Nondetermlnistic Machines
9 other sections not shown
a-experiment a.NIL absorption law access sort agents algorithms allow arbitrary assume atomic actions ax.B behaviour expressions behaviour identifiers behaviour operations behaviour programs bijection calculus carmunication Chapter complete components composite guards computation concurrent programming concurrent systems confluence congruence relation consider constraint cycler deduce define derivation derived calculus determinacy direct equivalence equations equivalence relation example Exercise Expansion Theorem experiment finite free variables function FV(B generalised implies inductive hypothesis inductive step infinite input labels laws machine Marked Graphs means multiset notion observation congruence observation equivalence output Petri Nets possible programming language Proof properties prove PUSH(s recursive definition relabelling represented restriction result sane scheduler semantic seme sequence simple specified strong congruence strong equivalence sum of guards sunmand synchronization techniques Theorem 5.3 theory translation tree tuple unary unary operation value expressions value-passing whence X-calculus yields