Communicating sequential processes
Communicating sequential processes
The weakest deadlock-preserving congruence
Information Processing Letters
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
Probing the Depths of CSP-M: A New fdr-Compliant Validation Tool
ICFEM '08 Proceedings of the 10th International Conference on Formal Methods and Software Engineering
Electronic Notes in Theoretical Computer Science (ENTCS)
A note on traces refinement and the conf relation in the unifying theories of programming
UTP'08 Proceedings of the 2nd international conference on Unifying theories of programming
Combining CSP and b for specification and property verification
FM'05 Proceedings of the 2005 international conference on Formal Methods
Models for data-flow sequential processes
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
| Hi-index | 0.00 |
We recast each of the three standard denotational models of CSP, namely Traces, Stable Failures and Failures-Divergences, by replacing the pseudo-event in each of them by an explicit representation of the termination traces of a process. The resulting recast models have simpler axiomatisations than their respective original counterparts and admit formulations of the compositional semantics of the basic processes and operators of CSP which are arguably clearer and therefore more intuitively appealing than those in the original models. Furthermore, the recast models facilitate the resolution of certain longstanding problematic issues, such as the offering of termination in an external choice alongside other behaviours, without resort to any incongruous special-casing which might compromise their regularity.