Some Concurrency Models in a Categorical Framework Extended Abstract

The paper deenes a taxonomy of concurrent models. Concurrent models are seen as categories and passages between models as functors. We particularly care about the notions of concurrency, causal and temporal dependencies and their possible diierent perception. According to the chosen model, only part of these notions are, indeed, relevant and recoverable from the observation of a concurrent system.

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

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

[3]  Glynn Winskel,et al.  Petri Nets, Algebras, Morphisms, and Compositionality , 1987, Inf. Comput..

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

[5]  Philippe Darondeau,et al.  Causal Trees , 1989, ICALP.

[6]  Rocco De Nicola,et al.  A Partial Ordering Semantics for CCS , 1990, Theor. Comput. Sci..

[7]  Mogens Nielsen,et al.  Models for Concurrency , 1992 .

[8]  Roberto Gorrieri,et al.  An Extended Expansion Theorem , 1991, TAPSOFT, Vol.2.

[9]  Glynn Winskel,et al.  Relationships Between Models of Concurrency , 1993, REX School/Symposium.

[10]  Roberto Gorrieri,et al.  On Relating Some Models for Concurrency , 1993, TAPSOFT.

[11]  Glynn Winskel,et al.  Bisimulation from Open Maps , 1994, Inf. Comput..