An Exercise in Concurrency: a CSP Process as a Condition/ event System

We provide full CSP with a truly concurrent and distributed operational semantics based on C/E Systems: given a CSP process Pr, a contact-free C/E System is derived the case graph of which is understood as the operational semantics of Pr. Thus concurrency and causal dependencies among the actions a process can perform are explicitly described.

[1]  Ugo Montanari,et al.  Concurrent Histories: A Basis for Observing Distributed Systems , 1987, J. Comput. Syst. Sci..

[2]  C. A. R. Hoare,et al.  Communicating Sequential Processes (Reprint) , 1983, Commun. ACM.

[3]  Wolfgang Reisig.  Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

[4]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[5]  Kurt Lautenbach,et al.  Elements of General Net Theory , 1979, Advanced Course: Net Theory and Applications.

[6]  Ernst-Rüdiger Olderog,et al.  Operational Petri net semantics for CCSP , 1986, European Workshop on Applications and Theory of Petri Nets.

[7]  George J. Milne,et al.  CIRCAL and the representation of communication, concurrency, and time , 1985, TOPL.

[8]  Gordon Plotkin,et al.  An Operational Semantics for CSP. , 1982 .

[9]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

[10]  Eike Best.  COSY: Its Relation to Nets and CSP , 1986, Advances in Petri Nets.

[11]  Wolfgang Reisig,et al.  Partial Order Semantics versus Interleaving Semantics for CSP-like Languages and its Impact on Fairness , 1984, ICALP.

[12]  Nissim Francez,et al.  Modeling the distributed termination convention of CSP , 1984, TOPL.

[13]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[14]  Wolfgang Reisig,et al.  CSP-programs with individual tokens , 1984, European Workshop on Applications and Theory in Petri Nets.