On Three Alternative Characterizations of Combined Traces

The combined trace (i.e., comtrace) notion was introduced by Janicki and Koutny in 1995 as a generalization of the Mazurkiewicz trace notion. Comtraces are congruence classes of step sequences, where the congruence relation is defined from two relations simultaneity and serializability on events. They also showed that comtraces correspond to some class of labeled stratified order structures, but left open the question of what class of labeled stratified orders represents comtraces. In this work, we proposed a class of labeled stratified order structures that captures exactly the comtrace notion. Our main technical contributions are representation theorems showing that comtrace quotient monoid, combined dependency graph (Kleijn and Koutny 2008) and our labeled stratified order structure characterization are three different and yet equivalent ways to represent comtraces. This paper is a revised and expanded version of Le (in Proceedings of PETRI NETS 2010, LNCS 6128, pp. 104-124).

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

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

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

[4]  Paul Gastin,et al.  From local to global temporal logics over Mazurkiewicz traces , 2006, Theor. Comput. Sci..

[5]  Stephan Merz,et al.  Model Checking , 2000 .

[6]  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 .

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

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

[9]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[10]  Volker Diekert,et al.  On First-Order Fragments for Mazurkiewicz Traces , 2007, Fundam. Informaticae.

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

[12]  Azadeh Farzan,et al.  Causal Atomicity , 2006, CAV.

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

[14]  Dai Tri Man Le,et al.  Modelling concurrency with comtraces and generalized comtraces , 2009, Inf. Comput..

[15]  Paul Gastin,et al.  Pure future local temporal logics are expressively complete for Mazurkiewicz traces , 2004, Inf. Comput..

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

[17]  Volker Diekert.  On the Concatenation of Infinite Traces , 1991, STACS.

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

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

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

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

[22]  Igor Walukiewicz,et al.  An expressively complete linear time temporal logic for Mazurkiewicz traces , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[23]  Vaughan R. Pratt,et al.  Modeling concurrency with partial orders , 1986, International Journal of Parallel Programming.

[24]  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).

[25]  Yves Métivier,et al.  Partial Commutation and Traces , 1997, Handbook of Formal Languages.

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

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

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

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

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

[31]  Igor Walukiewicz.  Local Logics for Traces , 2000 .

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

[33]  Brian A. Davey,et al.  An Introduction to Lattices and Order , 1989 .

[34]  Paul Gastin,et al.  Uniform Satisfiability in PSPACE for Local Temporal Logics Over Mazurkiewicz Traces , 2007, Fundam. Informaticae.

[35]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[36]  Javier Esparza,et al.  Unfoldings - A Partial-Order Approach to Model Checking , 2008, Monographs in Theoretical Computer Science. An EATCS Series.