Transition Systems, Event Structures and Unfoldings

A subclass of transition systems called elementary transition systems can be identified with the help of axioms based on a structural notion called regions. Elementary transition systems have been shown to be the transition system model of a basic system model of net theory called elementary net systems. Here we show that by smoothly strengthening the regional axioms for elementary transition systems, one obtains a subclass called occurrence transition system. We then prove that occurrence transition systems are the transition system model of yet another basic model of concurrency, namely, prime event structures. We then propose an operation of unfolding elementary transition systems into occurrence transition systems, We prove that it is "correct" in a strong categorical sense.

[1]  Grzegorz Rozenberg,et al.  Theory of Traces , 1988, Theor. Comput. Sci..

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

[3]  Grzegorz Rozenberg Behaviour of Elementary Net Systems , 1986 .

[4]  Glynn Winskel,et al.  Event Structures , 1986, Advances in Petri Nets.

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

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

[7]  P. S. Thiagarajan,et al.  Event Structures and Trace Monoids , 1991, Theor. Comput. Sci..

[8]  M. W. Shields,et al.  Behavioural Presentations , 1988, REX Workshop.

[9]  Marek Antoni Bednarczyk,et al.  Categories of asynchronous systems , 1987 .

[10]  Grzegorz Rozenberg,et al.  Behavioural notions for elementary net systems , 1989, Distributed Computing.