A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
A timed model for communicating sequential processes
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
Process algebra
Termination, deadlock, and divergence
Journal of the ACM (JACM)
Specification and proof in real-time CSP
Specification and proof in real-time CSP
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
The timed failures-stability model for CSP
Theoretical Computer Science
Communication and Concurrency
Mathematical Theory of Program Correctness
Mathematical Theory of Program Correctness
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Concurrent and Real Time Systems: The CSP Approach
Concurrent and Real Time Systems: The CSP Approach
An Improved Failures Model for Communicating Processes
Seminar on Concurrency, Carnegie-Mellon University
A Corrected Failure Divergence Model for CSP in Isabelle/HOL
FME '97 Proceedings of the 4th International Symposium of Formal Methods Europe on Industrial Applications and Strengthened Foundations of Formal Methods
Timed CSP: Theory and Practice
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Understanding Concurrent Systems
Understanding Concurrent Systems
Artificial Intelligence
| Hi-index | 5.23 |
In the original failure-divergence semantic model for Communicating Sequential Processes (CSP) the incomplete treatment of successful process termination, and in particular parallel termination, permitted unnatural processes to be defined where the behaviour of the system did not match the intention of the specification. In response to this problem we propose the introduction of three distinct but related parallel operators that between them provide a transparent and intuitive means for specifying the desired termination of concurrent processes where no such unnatural behaviours take place. We provide a comprehensive account of their semantics, algebraic properties and the relationship between them, and demonstrate that these new operators can replace the set of parallel operators defined in the original treatment of CSP. By way of a number of examples of the use of these operators we demonstrate how they provide a much more expressive, intuitive and robust system for the specification of parallel composition.