Semantics of Parallelism: Non-Interleaving Representation of Behaviour
Semantics of Parallelism is the only book which provides a unified treatment of the non-interleaving approach to process semantics (as opposed to the interleaving approach of the process algebraists). Many results found in this book are collected for the first time outside conference and journal articles on the mathematics of non-interleaving semantics. It gives the reader a unified view of various attempts to model parallelism within one conceptual frame work. It is aimed at postgraduates in theoretical computer science and academics who are teaching and researching in the modelling of discrete, concurrent/distributed systems. Workers in the information technology industry who are interested in available theoretical studies on parallelism will also be interested in this book.
3 pages matching "F. X. Reid" 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.
Whys and Wherefores
23 other sections not shown
ascending chains asynchronous behavioural presentation asynchronous hybrid transition asynchronous transition system automata bijection bisimulation transform C/E system chapter computation graph concurrency consistently complete construction contradiction define DEFINITION described discrete behavioural presentation elements embedding equivalence classes equivalence relation event structure example exists expression faintly guarded finite follows function Hence holds HProc hybrid transition system independence relation indexed family initialised hybrid transition labelled least upper bounds left-closed LEMMA linguistic behavioural presentation loosely coupled system mapping max(p monoid morphism nets notation o e p occurrence parallel partial order partially ordered set pB(P poset isomorphism Pr(x prime algebraic Process Calculus process structure PROPOSITION Px(G recursion satisfies sequence sequential behavioural presentation strong bisimulation strongly forward stable structural induction Suppose surjective T-elements TCSP THEOREM theory totally ordered vector languages