Communicating sequential processes
Communicating sequential processes
Beauty is our business
Handbook of logic in computer science (vol. 3)
Guarded commands, nondeterminacy and formal derivation of programs
Communications of the ACM
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Trace Refinement of Action Systems
CONCUR '94 Proceedings of the Concurrency Theory
ACM Transactions on Programming Languages and Systems (TOPLAS)
Hierarchical organisation of predicate-semantic models
UTP'06 Proceedings of the First international conference on Unifying Theories of Programming
Generating c code from LOGS specifications
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
| Hi-index | 0.00 |
This paper studies the laws of communicating sequential processes (CSP) with Z-like initial and final states. Instead of defining a large semantics including all observable aspects, we incrementally develop the model in three stages: partially correct relational model, then totally correct sequential model and finally the reactive-process model with states. The properties of each model are captured as algebraic laws. A law in one model may or may not be true in its submodels. We apply a technique based on healthiness conditions to identify the conditions for law inheritance. Such abstract conditions themselves can be captured as pattern laws of commutativity. The model uses a new approach to define parallel compositions using just the primitive commands, nondeterministic choice, conjunction and some unary (hiding) operators.