Formal Relationships Between Geometrical and Classical Models for Concurrency

A wide variety of models for concurrent programs has been proposed during the past decades, each one focusing on various aspects of computations: trace equivalence, causality between events, conflicts and schedules due to resource accesses, etc. More recently, models with a geometrical flavor have been introduced, based on the notion of cubical set. These models are very rich and expressive since they can represent commutation between any number of events, thus generalizing the principle of true concurrency. While they are emerging as a central tool in concurrency, which is very promising because they make possible the use of techniques from algebraic topology in order to study concurrent computations, they have not yet been precisely related to the previous models, and the purpose of this paper is to fill this gap. In particular, we describe an adjunction between Petri nets and cubical sets which extends the previously known adjunction between Petri nets and asynchronous transition systems by Nielsen and Winskel.

[1]  Glynn Winskel,et al.  Event Structures with Symmetry , 2007, Computation, Meaning, and Logic.

[2]  I. Moerdijk,et al.  Sheaves in geometry and logic: a first introduction to topos theory , 1992 .

[3]  A. Arnold.  Systèmes de transitions finis et sémantique des processus communicants , 1990 .

[4]  Glynn Winskel,et al.  Bisimulation and open maps , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[5]  Martin Raußen,et al.  On the classification of dipaths in geometric models for concurrency , 2000, Mathematical Structures in Computer Science.

[6]  Antti Valmari,et al.  A stubborn attack on state explosion , 1990, Formal Methods Syst. Des..

[7]  Vladimiro Sassone,et al.  Higher dimensional transition systems , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[8]  Madhavan Mukund.  Petri Nets and Step Transition Systems , 1992, Int. J. Found. Comput. Sci..

[9]  Lisbeth Fajstrup,et al.  Loops, ditopology and deadlocks , 2000, Mathematical Structures in Computer Science.

[10]  James L. Peterson,et al.  Petri Nets , 1977, CSUR.

[11]  Eric Goubault,et al.  Homology of Higher Dimensional Automata , 1992, CONCUR.

[12]  Lisbeth Fajstrup,et al.  Dipaths and dihomotopies in a cubical complex , 2005, Adv. Appl. Math..

[13]  M. Grandis.  Directed Algebraic Topology: Models of Non-Reversible Worlds , 2009 .

[14]  Philippe Gaucher,et al.  Combinatorics of labelling in higher-dimensional automata , 2008, Theor. Comput. Sci..

[15]  Rob J. van Glabbeek,et al.  On the expressiveness of higher dimensional automata , 2006, Theor. Comput. Sci..

[16]  Glynn Winskel,et al.  Symmetry in Petri Nets , 2008 .

[17]  Manfred Droste,et al.  Petri nets and automata with concurrency relations—an adjunction , 1993 .

[18]  Jean-Pierre Serre,et al.  Homologie singulière des espaces fibrés. Applications , 2003 .

[19]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[20]  Glynn Winskel,et al.  Relationships between Models of Concurency , 1993 .

[21]  Vaughan R. Pratt,et al.  Modeling concurrency with geometry , 1991, POPL '91.

[22]  Containment in Rule-Based Models , 2012, Electron. Notes Theor. Comput. Sci..

[23]  Eric Goubault,et al.  Cubical Sets are Generalized Transition Systems , 2001 .

[24]  Eric Goubault,et al.  Detecting Deadlocks in Concurrent Systems , 1996, CONCUR.

[25]  Jean-Pierre Serre,et al.  Homologie Singuliere Des Espaces Fibres , 1951 .

[26]  Marco Grandis,et al.  CUBICAL SETS AND THEIR SITE , 2003 .

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

[28]  Albert Burroni,et al.  Higher-Dimensional Word Problems with Applications to Equational Logic , 1993, Theor. Comput. Sci..

[29]  Ulrich Fahrenberg,et al.  A Category of Higher-Dimensional Automata , 2005, FoSSaCS.

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

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

[32]  P. J. Higgins,et al.  On the algebra of cubes , 1981 .

[33]  C. A. Petri.  Communication with automata , 1966 .

[34]  Philip S. Mulry,et al.  Lifting Theorems for Kleisli Categories , 1993, MFPS.

[35]  Glynn Winskel,et al.  On the Expressivity of Symmetry in Event Structures , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[36]  Lisbeth Fajstrup,et al.  Infinitely Running Concurrent Processes with Loops from a Geometric Viewpoint , 2001, Electron. Notes Theor. Comput. Sci..

[37]  Krzysztof Worytkiewicz.  Paths and Simulations , 2002, CTCS.

[38]  Samuel Mimram.  Sémantique des jeux asynchrones et réécriture 2-dimensionnelle. (Asynchronous Game Semantics and 2-dimensional Rewriting Systems) , 2008 .

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

[40]  Pierre Wolper,et al.  Using partial orders for the efficient verification of deadlock freedom and safety properties , 1991, Formal Methods Syst. Des..

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

[42]  Marek Antoni Bednarczyk,et al.  Categories of asynchronous systems , 1987 .

[43]  Henny B. Sipma,et al.  Petri Net Analysis Using Invariant Generation , 2003, Verification: Theory and Practice.

[44]  Rob J. van Glabbeek.  Petri Nets, Configuration Structures and Higher Dimensional Automata , 1999, CONCUR.

[45]  Eric Goubault,et al.  Algebraic topology and concurrency , 2006, Theor. Comput. Sci..

[46]  Dimitrios J. Economou.  On Galois theories , 2014 .