Alphabets of Acyclic Invariant Structures

A step trace is an equivalence class of step sequences, where the equivalence is determined by dependencies between pairs of actions expressed as potential simultaneity and sequentialisability. Step traces can be represented by invariant structures with two relations: mutual exclusion and (possibly cyclic) weak causality. An important issue concerning invariant structures is to decide whether an invariant structure represents a step trace over a given step alphabet. For the general case this problem has been solved and an effective decision procedure has been proposed. In this paper, we restrict the class of order structures being considered with the aim of achieving a better characterisation. Requiring that the weak causality relation is acyclic, makes it possible to solve the problem in a purely local way, by considering pairs of events, rather than whole structures.

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

[2]  Maciej Koutny,et al.  On Synthesising Step Alphabets for Acyclic Invariant Structures , 2017, ATAED@Petri Nets/ACSD.

[3]  J. Grabowski,et al.  On partial languages , 1981, Fundam. Informaticae.

[4]  Grzegorz Rozenberg,et al.  Subset Languages of Petri Nets , 1982, European Workshop on Applications and Theory of Petri Nets.

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

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

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

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

[9]  Andrzej Ehrenfeucht,et al.  Reaction Systems , 2007, Fundam. Informaticae.

[10]  Grzegorz Rozenberg,et al.  Subset Languages of Petri Nets Part I: The Relationship to String Languages and Normal Forms , 1983, Theor. Comput. Sci..

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

[12]  Maciej Koutny,et al.  Step traces , 2015, Acta Informatica.

[13]  Maciej Koutny,et al.  Invariant Structures and Dependence Relations , 2017, Fundam. Informaticae.

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

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

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

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

[18]  Francesca Rossi,et al.  Contextual nets , 1995, Acta Informatica.

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