Semantics of Parallelism: Non-Interleaving Representation of BehaviourSemantics 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. |
Contents
Whys and Wherefores | 1 |
Another Event Structure Model | 6 |
Behavioural Presentations | 14 |
Copyright | |
26 other sections not shown
Other editions - View all
Semantics of Parallelism: Non-Interleaving Representation of Behaviour Michael W. Shields Limited preview - 2012 |
Common terms and phrases
a₂ action associated asynchronous transition system B₁ B₂ behavioural presentation bijection bisimulation bounds c₂ chapter closed complete computation graph concurrency consequence consider consistently construction contains contradiction Conversely corresponding define DEFINITION denote derivation described determines discrete behavioural presentation elements equivalence establish event structure example exists expression figure Finally finite follows function given giving guarded Hence holds hybrid transition system induction initial initialised isomorphism labelled languages least left-closed LEMMA mapping means morphism namely nets notation observe occurrence operator otherwise P₁ P₂ parallel partial order path possible Pr(x prime PROOF PROPOSITION prove q₁ q₂ relation relationship represents result satisfies semantics sequence sequential shown strong structure Suppose t₂ theory trace u₂ unambiguous vector write