Partial orderings descriptions and observations of nondeterministic concurrent processes

A methodology is introduced for defining truly concurrent semantics of processes as equivalence classes of Labelled Event Structures (LES). The construction of a les providing the operational semantics of systems consists of three main steps. First, systems are decomposed into sets of sequential processes and a set of rewriting rules is introduced which describe both the actions sequential processes may perform and their causal relation. Then, the rewriting rules are used to build an occurrence net. Finally, the required event structure is easily derived from the occurrence net. As a test case, a partial ordering operational semantics is introduced first for a subset of Milner's CCS and then for the whole calculus. The proposed semantics are consistent with the original interleaving semantics of the calculus and are able to capture all and only the parallelism present in its multiset semantics. In order to obtain more abstract semantic definitions, new notions of observational equivalence on Labelled Event Structures are introduced that preserve both concurrency and nondeterminism.

[1]  Rocco De Nicola,et al.  CCS is an (Augmented) Contact Free C/E System , 1986, Mathematical Models for the Semantics of Parallelism.

[2]  Ursula Goltz,et al.  Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract) , 1989, MFCS.

[3]  Glynn Winskel,et al.  Seminar on Concurrency , 1984, Lecture Notes in Computer Science.

[4]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains , 1979, Semantics of Concurrent Computation.

[5]  Robin Milner,et al.  Calculi for Synchrony and Asynchrony , 1983, Theor. Comput. Sci..

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

[7]  Glynn Winskel,et al.  Categories of Models for Concurrency , 1984, Seminar on Concurrency.

[8]  Rocco De Nicola,et al.  On the consistency of 'truly concurrent' operational and denotational semantics , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

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

[10]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[11]  Mogens Nielsen CCS - and its Relationship to Net Theory , 1986, Advances in Petri Nets.

[12]  Rocco De Nicola,et al.  Testing Equivalences for Event Structures , 1986, Mathematical Models for the Semantics of Parallelism.

[13]  Ugo Montanari,et al.  Labeled Event Structures: A Model for Observable Concurrency , 1982, Formal Description of Programming Concepts.

[14]  Ilaria Castellani,et al.  On the Semantics of Concurrency: Partial Orders and Transition Systems , 1987, TAPSOFT, Vol.1.

[15]  Robert M. Keller,et al.  Formal verification of parallel programs , 1976, CACM.

[16]  Glynn Winskel,et al.  Event Structures , 1986, Advances in Petri Nets.

[17]  Marisa Venturini Zilli Mathematical Models for the Semantics of Parallelism , 1987, Lecture Notes in Computer Science.

[18]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..

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

[20]  Grzegorz Rozenberg Advances in Petri Nets 1987 , 1986, Lecture Notes in Computer Science.

[21]  Rocco De Nicola,et al.  Observational equivalences for concurrency models , 1987, Formal Description of Programming Concepts.

[22]  Wolfgang Reisig,et al.  The Non-sequential Behavior of Petri Nets , 1983, Inf. Control..

[23]  Józef Winkowski,et al.  Behaviours of Concurrent Systems , 1980, Theor. Comput. Sci..

[24]  Glynn Winskel,et al.  Events in computation , 1980 .

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

[26]  Gérard Boudol,et al.  Algèbre de Processus et Synchronisation , 1984, Theor. Comput. Sci..