On the Expressiveness of Higher Dimensional Automata: (Extended Abstract)

In this paper I compare the expressive power of several models of concurrency based on their ability to represent causal dependence. To this end, I translate these models, in behaviour preserving ways, into the model of higher dimensional automata, which is the most expressive model under investigation. In particular, I propose four different translations of Petri nets, corresponding to the four different computational interpretations of nets found in the literature.I also extend various equivalence relations for concurrent systems to higher dimensional automata. These include the history preserving bisimulation, which is the coarsest equivalence that fully respects branching time, causality and their interplay, as well as the ST-bisimulation, a branching time respecting equivalence that takes causality into account to the extent that it is expressible by actions overlapping in time. Through their embeddings in higher dimensional automata, it is now well-defined whether members of different models of concurrency are equivalent.

[1]  Richard Buckland.  Choice As A First Class Citizen , 1996 .

[2]  Régis Cridlig,et al.  Semantic analysis of shared-memory concurrent languages using abstract model-checking , 1995, PEPM '95.

[3]  Glynn Winskel,et al.  An Introduction to Event Structures , 1989 .

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

[5]  Vaughan R. Pratt,et al.  Higher dimensional automata revisited , 2000, Mathematical Structures in Computer Science.

[6]  Rob J. van Glabbeek,et al.  Petri Net Models for Algebraic Theories of Concurrency , 1987, PARLE.

[7]  Philippe Gaucher,et al.  Homotopy invariants of higher dimensional categories and concurrency in computer science , 1999, Mathematical Structures in Computer Science.

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

[9]  José Meseguer,et al.  On the Semantics of Petri Nets , 1992, CONCUR.

[10]  Eric Goubault,et al.  Dihomotopy as a Tool in State Space Analysis , 2002, LATIN.

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

[12]  Ursula Goltz,et al.  Refinement of actions and equivalence notions for concurrent systems , 2001, Acta Informatica.

[13]  Gordon D. Plotkin,et al.  Configuration structures , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[14]  R. J. vanGlabbeek.  The refinement theorem for ST-bisimulation semantics , 1990 .

[15]  Wolfgang Reisig,et al.  Petri Nets: Applications and Relationships to Other Models of Concurrency , 1986, Lecture Notes in Computer Science.

[16]  Philippe Gaucher,et al.  The branching nerve of HDA and the Kan condition , 2001, ArXiv.

[17]  Gordon D. Plotkin,et al.  Event Structures for Resolvable Conflict , 2004, MFCS.

[18]  Eric Goubault,et al.  Semantics and Analysis of Linda-Based Languages , 1993, WSA.

[19]  Simon L. Peyton Jones,et al.  Imperative functional programming , 1993, POPL '93.

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

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

[22]  Irène Guessarian,et al.  Semantics of systems of concurrent processes : LITP Spring School on Theoretical Computer Science, La Roche Posay, France, April 23-27, 1990, proceedings , 1990 .

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

[24]  Lisbeth Fajstrup,et al.  Detecting Deadlocks in Concurrent Systems , 1996 .

[25]  Irène Guessarian.  Semantics of Systems of Concurrent Processes , 1990, Lecture Notes in Computer Science.

[26]  Yukihide Takayama.  Towards Cycle Filling as Parallelization(Concurrency Theory and Applications '96) , 1997 .

[27]  Raymond R. Devillers,et al.  Concurrent bisimulations in Petri nets , 2005, Acta Informatica.

[28]  Frits W. Vaandrager,et al.  Bundle Event Structures and CCSP , 2003, CONCUR.

[29]  Jeremy Gunawardena,et al.  Homotopy and Concurrency , 2001, Bull. EATCS.

[30]  Régis Cridlig,et al.  Implementing a Static Analyzer of Concurrent Programs: Problems and Perspectives , 1996, LOMAPS.

[31]  P. Gaucher.  A MODEL CATEGORY FOR THE HOMOTOPY THEORY OF CONCURRENCY , 2003, math/0308054.

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

[33]  Vaughan R. Pratt,et al.  Transition and cancellation in concurrency and branching time , 2003, Mathematical Structures in Computer Science.

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

[35]  Philippe Gaucher,et al.  About the globular homology of higher dimensional automata , 2000, ArXiv.

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

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

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

[39]  Michael Johnson,et al.  On the Specification of Higher Dimensional Automata , 2002, Electron. Notes Theor. Comput. Sci..

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

[41]  Eric Goubault.  Domains of Higher-Dimensional Automata , 1993, CONCUR.

[42]  Philippe Gaucher.  Investigating The Algebraic Structure of Dihomotopy Types , 2001, Electron. Notes Theor. Comput. Sci..

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

[44]  Yukihide Takayama.  Parallelization of Concurrent Processes in Higher Dimensional Automata(Theory of Rewriting Systems and Its Applications) , 1995 .

[45]  Gérard Boudol.  Flow Event Structures and Flow Nets , 1990, Semantics of Systems of Concurrent Processes.

[46]  J. C. M. Baeten,et al.  Process Algebra: Bibliography , 1990 .

[47]  Eric Goubault,et al.  A Semantic View On Distributed Computability And Complexity , 1996 .

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

[49]  Eric Goubault,et al.  Geometry and concurrency: a user's guide , 2000, Mathematical Structures in Computer Science.

[50]  Stefan Sokolowski,et al.  A case for po-manifolds - in chase after a good topological model for concurrency , 2003, GETCO.

[51]  Christos H. Papadimitriou,et al.  The Theory of Database Concurrency Control , 1986 .

[52]  Frits W. Vaandrager,et al.  The Difference between Splitting in n and n+1 , 1995, Inf. Comput..

[53]  É. Goubault,et al.  Topological deformation of higher dimensional automata , 2001, math/0107060.

[54]  Yukihide Takayama.  Extraction of Concurrent Processes from Higher Dimensional Automata , 1996, CAAP.

[55]  Philippe Gaucher,et al.  Combinatorics of branchings in higher dimensional automata , 1999, ArXiv.

[56]  Eric Goubault,et al.  Schedulers as abstract interpretations of higher-dimensional automata , 1995, PEPM '95.

[57]  Glynn Winskel,et al.  Petri Nets and Bisimulation , 1996, Theor. Comput. Sci..

[58]  Philippe Gaucher,et al.  From Concurrency to Algebraic Topology , 2000, GETCO.

[59]  Eric Goubault,et al.  Durations for Truly-Concurrent Transitions , 1996, ESOP.