Relational structures for concurrent behaviours

Abstract Relational structures based on acyclic relations can successfully model fundamental aspects of concurrent systems behaviour. Examples include Elementary Net systems and Mazurkiewicz traces. There are however cases where more general relational structures are needed. In this paper, we present a general model of relational structures which can be used for a broad class of concurrent behaviours. We demonstrate how this general set-up works for combined order structures which are based on two relations, viz. an acyclic ‘before’ relation and a possibly cyclic ‘not later than’ relation.

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

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

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

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

[5]  Ryszard Janicki,et al.  Modeling concurrency with interval traces , 2017, Inf. Comput..

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

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

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

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

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

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

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

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

[14]  Ugo Montanari,et al.  Concurrent Histories: A Basis for Observing Distributed Systems , 1987, J. Comput. Syst. Sci..

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

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

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

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

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

[20]  Kenneth L. McMillan,et al.  A technique of state space search based on unfolding , 1995, Formal Methods Syst. Des..

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

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

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

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

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

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