On Models and Algebras for Concurrent Processes

The paper consists of two parts. In the first part, three different groups of models for concurrent systems and processes are surveyed: 1) the models representing concurrency as nondeterministic interleaving of atomic actions; 2) the models representing concurrency as interleaving of multisets of actions; and 3) the models describing true concurrency. A number of algebras and algebraic calculi axiomatizing these models are discussed. Different equivalence relations introduced in these models are compared.

[1]  Lucia Pomello,et al.  Some equivalence notions for concurrent systems. An overview , 1985, Applications and Theory in Petri Nets.

[2]  Wolfgang Reisig,et al.  Processes of Place/Transition-Nets , 1983, ICALP.

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

[4]  Roy H. Campbell,et al.  The specification of process synchronization by path expressions , 1974, Symposium on Operating Systems.

[5]  Alan Mycroft,et al.  On the Relationship of CCS and Petri Nets , 1984, ICALP.

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

[7]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[8]  C. A. R. Hoare,et al.  A Model for Communicating Sequential Processes , 1980, On the Construction of Programs.

[9]  Vadim E. Kotov,et al.  An Algebra for Parallelism Based on Petri Nets , 1978, MFCS.

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

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

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

[13]  Jan A. Bergstra,et al.  An operational semantics for process algebra , 1985 .

[14]  Ludmila Cherkasova,et al.  On structural properties of generalized processes , 1984, European Workshop on Applications and Theory in Petri Nets.

[15]  Ludmila Cherkasova,et al.  Descriptive and analytical process algebras , 1988, European Workshop on Applications and Theory in Petri Nets.

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

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

[18]  Vaughan R. Pratt,et al.  Modeling concurrency with partial orders , 1986, International Journal of Parallel Programming.

[19]  Manfred Droste.  Event Structures and Domains , 1989, Theor. Comput. Sci..

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

[21]  Ernst-Rüdiger Olderog,et al.  TCSP: Theory of Communicating Sequential Processes , 1986, Advances in Petri Nets.

[22]  César Fernández.  Non-sequential Processes , 1986, Advances in Petri Nets.

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

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

[25]  M. W. Shields.  Adequate Path Expressions , 1979, Semantics of Concurrent Computation.