Step traces

In the classical Mazurkiewicz trace approach the behaviour of a concurrent system is described in terms of sequential observations that differ only with respect to their ordering of independent actions. This paper investigates an extension of the trace model to the case that actions can be observed as occurring simultaneously. Thus observations are sequences of steps, i.e., sets of actions. This leads to a step trace model based on three relations between events: simultaneity, serialisability, and interleaving. Whereas the underlying causal structures of traces are based on dependencies between actions leading to a partial order interpretation, more general causal structures are needed to describe the invariant relationships between the action occurrences in a step trace. We present a complete picture including dependence structures extending dependence graphs, and a characterisation of step traces in terms of invariant order structures.

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

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

[3]  Maciej Koutny,et al.  Folded Hasse diagrams of combined traces , 2014, Information Processing Letters.

[4]  Joost Engelfriet,et al.  Elementary Net Systems , 1996, Applications and Theory of Petri Nets.

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

[6]  Maciej Koutny,et al.  Order Structures for Subclasses of Generalised Traces , 2015, LATA.

[7]  Dietrich Kuske,et al.  Pomsets for Local Trace Languages - Recognizability, Logic & Petri Nets , 2000, CONCUR.

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

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

[10]  Grzegorz Rozenberg,et al.  Dependence Graphs , 1995, The Book of Traces.

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

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

[13]  Walter Vogler Partial order semantics and read arcs , 2002, Theor. Comput. Sci..

[14]  Paul Gastin,et al.  Infinite Traces , 1990, Semantics of Systems of Concurrent Processes.

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

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

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

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

[19]  Antoni W. Mazurkiewicz,et al.  Trace Theory , 1986, Advances in Petri Nets.

[20]  Antoni W. Mazurkiewicz,et al.  Basic notions of trace theory , 1988, REX Workshop.

[21]  Brigitte Rozoy,et al.  Reliable Generalized and Context Dependent Commutation Relations , 1997, TAPSOFT.

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

[23]  Elöd Knuth,et al.  Semi-Commutations and Petri Nets , 1989, Theor. Comput. Sci..

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

[25]  Maciej Koutny,et al.  Mutex Causality in Processes and Traces of General Elementary Nets , 2013, Fundam. Informaticae.

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

[27]  Wojciech Zielonka,et al.  The Book of Traces , 1995 .

[28]  Maciej Koutny,et al.  Causal Structures for General Concurrent Behaviours , 2013, CS&P.

[29]  G. Michele Pinna,et al.  Process Semantics for Place/Transition Nets with Inhibitor and Read Arcs , 1999, Fundam. Informaticae.

[30]  Paul Gastin,et al.  Recognizable Complex Trace Languages , 1991, MFCS.

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

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

[33]  Leslie Lamport,et al.  The mutual exclusion problem: part I—a theory of interprocess communication , 1986, JACM.

[34]  M. Koutny,et al.  Generalising Traces , 2014 .

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

[36]  Ryszard Janicki,et al.  Modeling Interval Order Structures with Partially Commutative Monoids , 2012, CONCUR.

[37]  Wolfgang Reisig,et al.  Lectures on Petri Nets I: Basic Models , 1996, Lecture Notes in Computer Science.

[38]  Maciej Koutny,et al.  Characterising Concurrent Histories , 2015, Fundam. Informaticae.

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

[40]  P. S. Thiagarajan,et al.  A Trace Semantics for Petri Nets , 1995, Inf. Comput..

[41]  G. Michele Pinna,et al.  Domain and event structure semantics for Petri nets with read and inhibitor arcs , 2004, Theor. Comput. Sci..

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

[43]  Wojciech Penczek,et al.  Traces and Logic , 1995, The Book of Traces.

[44]  Igor Walukiewicz,et al.  An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces , 1997, Inf. Comput..