A Classification of Models for Concurrency

Models for concurrency can be classified with respect to the three relevant parameters: behaviour/system, interleaving/noninterleaving, linear/branching time. When modelling a process, a choice concerning such parameters corresponds to choosing the level of abstraction of the resulting semantics. The classifications are formalised through the medium of category theory.

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

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

[3]  Antoni W. Mazurkiewicz,et al.  Basic notions of trace theory , 1988, REX Workshop.

[4]  Glynn Winskel,et al.  Event Structure Semantics for CCS and Related Languages , 1982, ICALP.

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

[6]  Eugene W. Stark,et al.  Concurrent Transition Systems , 1989, Theor. Comput. Sci..

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

[8]  Glynn Winskel,et al.  Deterministic Behavioural Models for Concurrency , 1993, MFCS.

[9]  C. Petri.  Kommunikation mit Automaten , 1962 .

[10]  Matthew Hennessy,et al.  Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.

[11]  M. W. Shields.  Concurrent Machines , 1985, Comput. J..

[12]  Glynn Winskel,et al.  Synchronization Trees , 1984, Theor. Comput. Sci..

[13]  Glynn Winskel,et al.  Models for Concurrency , 1992 .

[14]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.