×

Bundle event structures and CCSP. (English) Zbl 1274.68262

Amadio, Roberto (ed.) et al., CONCUR 2003 – concurrency theory. 14th international conference, Marseille, France, September 3–5, 2003. Proceedings. Berlin: Springer (ISBN 3-540-40753-7/pbk). Lect. Notes Comput. Sci. 2761, 57-71 (2003).
Summary: We investigate which event structures can be denoted by means of closed \(\text{CCS} \cup \text{CSP}\) expressions. Working up to isomorphism we find that
– all denotable event structures are bundle event structures,
– upon adding an infinitary parallel composition all bundle event structures are denotable,
– without it every finite bundle event structure can be denoted,
– as well as every countable prime event structure with binary conflict.
Up to hereditary history preserving bisimulation equivalence finitary conflict can be expressed in terms of binary conflict. In this setting all countable stable event structures are denotable.
For the entire collection see [Zbl 1026.00029].

MSC:

68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Software:

CCSP
PDFBibTeX XMLCite
Full Text: DOI