3 pages matching access sort in this book
Results 1-3 of 3
What people are saying - Write a review
We haven't found any reviews in the usual places.
Translation into CCS
l0 Determinacy and Confluence
1 other sections not shown
a-experiment a.NIL absorption law acceptors access sort agents algorithms allow arbitrary atomic actions ax.B behaviour expressions behaviour identifiers behaviour operations behaviour programs bijection calculus CELL2 Chapter components computation concurrent systems confluence congruence relation consider constraint cycler deadlock deduce define derivations derived calculus determinacy direct equivalence equations equivalence relation example Exercise Expansion Theorem experiment finite free variables function FV(B generalisation Gordon Plotkin implies inductive hypothesis inductive step infinite input labels laws machine means multiset Note notion observation congruence observation equivalence output Petri Net possible programming language proof techniques properties Proposition prove PUSH(s recursive definition relabelling represented restriction result saue scheduler semantic semaphore seme sequence simple specified strong congruence strong equivalence sum of guards summand synchronization syntax Theorem 5.3 theory translation tree tuple unary unary operation value expressions value-passing whence X-calculus yields