Modelling concurrency with comtraces and generalized comtraces

Comtraces (combined traces) are extensions of Mazurkiewicz traces that can model the ''not later than'' relationship. In this paper, we first introduce the novel notion of generalized comtraces, extensions of comtraces that can additionally model the ''non-simultaneously'' relationship. Then we study some basic algebraic properties and canonical representations of comtraces and generalized comtraces. Finally we analyze the relationship between generalized comtraces and generalized stratified order structures. The major technical contribution of this paper is a proof showing that generalized comtraces can be represented by generalized stratified order structures.

[1]  Ryszard Janicki,et al.  Specification and Analysis of Concurrent Systems , 1992, EATCS Monographs in Theoretical Computer Science.

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

[3]  Antoni W. Mazurkiewicz,et al.  Introduction to Trace Theory , 1995, The Book of Traces.

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

[5]  Dai Tri Man Le.  A Characterization of Combined Traces Using Labeled Stratified Order Structures , 2010, Petri Nets.

[6]  Volker Diekert,et al.  The Book of Traces , 1995 .

[7]  A. Mazurkiewicz.  Concurrent Program Schemes and their Interpretations , 1977 .

[8]  E. Szpilrajn.  Sur l'extension de l'ordre partiel , 1930 .

[9]  Dai Tri Man Le,et al.  Modelling Concurrency with Quotient Monoids , 2008, Petri Nets.

[10]  Maciej Koutny,et al.  Structure of Concurrency , 1991, Theor. Comput. Sci..

[11]  David Lorge Parnas,et al.  Using assertions about traces to write abstract specifications for software modules , 1978, ECI.

[12]  Maciej Koutny,et al.  Fundamentals of modelling concurrency using discrete relational structures , 1997, Acta Informatica.

[13]  Marta Pietkiewicz-Koutny.  The Synthesis Problem for Elementary Net Systems with Inhibitor Arcs , 1999, Fundam. Informaticae.

[14]  Maciej Koutny,et al.  Semantics of Inhibitor Nets , 1995, Inf. Comput..

[15]  Walter Vogler,et al.  A generalization of traces , 1991, RAIRO Theor. Informatics Appl..

[16]  Sebastian Mauser,et al.  Synchronous + Concurrent + Sequential = Earlier than + Not later than , 2006, Sixth International Conference on Application of Concurrency to System Design (ACSD'06).

[17]  Wieslaw Zielonka,et al.  Notes on Finite Asynchronous Automata , 1987, RAIRO Theor. Informatics Appl..

[18]  Maciej Koutny,et al.  Invariants and paradigms of concurrency theory , 1991, Future Gener. Comput. Syst..

[19]  Haim Gaifman,et al.  Partial Order Models of Concurrency and the Computation of Functions , 1987, LICS.

[20]  Maciej Koutny,et al.  Process semantics of general inhibitor nets , 2004, Inf. Comput..

[21]  Ryszard Janicki,et al.  Relational structures model of concurrency , 2008, Acta Informatica.

[22]  Maciej Koutny,et al.  On Causality Semantics of Nets with Priorities , 1999, Fundam. Informaticae.

[23]  George Gratzer,et al.  Universal Algebra , 1979 .

[24]  Philippe Darondeau,et al.  The Synthesis Problem for Elementary Net Systems is NP-Complete , 1997, Theor. Comput. Sci..

[25]  Edward Ochmanski.  Recognizable Trace Languages , 1995, The Book of Traces.

[26]  Ryszard Janicki,et al.  Specification and Analysis of Concurrent Systems: The Cosy Approach , 1992 .

[27]  Robert Lorenz,et al.  Synthesis of Controlled Behavior with Modules of Signal Nets , 2004, ICATPN.

[28]  Maciej Koutny,et al.  Concurrent and Maximally Concurrent Evolution of Nonsequential Systems , 1986, Theor. Comput. Sci..

[29]  Dai Tri Man Le,et al.  On Three Alternative Characterizations of Combined Traces , 2010, Fundam. Informaticae.

[30]  Dai Le.  Studies in Comtrace Monoids , 2008 .

[31]  Maciej Koutny,et al.  Formal Languages and Concurrent Behaviours , 2008, New Developments in Formal Languages and Applications.

[32]  Pierre Cartier,et al.  Problemes combinatoires de commutation et rearrangements , 1969 .

[33]  Sebastian Mauser,et al.  Complete Process Semantics of Petri Nets , 2008, Fundam. Informaticae.

[34]  Ryszard Janicki,et al.  Modelling Concurrent Behaviours by Commutativity and Weak Causality Relations , 2002, AMAST.

[35]  Manfred Kufleitner,et al.  On recognizable trace languages , 2007 .

[36]  Bard Bloom,et al.  Trade-Offs in True Concurrency: Pomsets and Mazurkiewicz Traces , 1991, MFPS.

[37]  Sebastian Mauser,et al.  Causal Semantics of Algebraic Petri Nets distinguishing Concurrency and Synchronicity , 2008, Fundam. Informaticae.