Skip to main content

Modeling the Distributed Termination Convention of CSP

Krzysztof R. Apt, Nissim Francez

PDF DOI 10.1145/579.584 dblp BibTeX

Abstract

How the distributed termination convention of CSP repetitive commands can be modeled using other CSP constructs is shown.The presented transformation suggests a simple implementation of this convention.We argue that this convention should be used as a compiler option.

Related papers

A Proof System for Communicating Sequential Processes TOPLAS 1980
Full Abstraction of a Real-Time Denotational Semantics for an Occam-like Language POPL 1987
A Distributed Deadlock Detection Algorithm for CSP-Like Communication TOPLAS 1990
An Effective Implementation for the Generalized Input-Output Construct of CSP TOPLAS 1983
Santa Claus: Formal analysis of a process-oriented solution TOPLAS 2010
Appraising Fairness in Languages for Distributed Programming POPL 1987
Hierarchical Compression for Model-Checking CSP or How to Check 1020 Dining Philosophers for Deadlock TACAS 1995
A Formal Definition of Priority in CSP TOPLAS 1993