Sandie Balaguer, Thomas Chatain & Stefan Haar (2013):
Building Occurrence Nets from Reveals Relations.
Fundamamenta Informaticae 123(3),
pp. 245–272.
Available at http://dx.doi.org/10.3233/FI-2013-809.
Giovanni Casu & G. Michele Pinna (2017):
Merging Relations: A Way to Compact Petri Nets' Behaviors Uniformly.
In: Frank Drewes, Carlos Martín-Vide & Bianca Truthe: LATA 2017 Conference Proceedings,
Lecture Notes in Computer Science 10168,
pp. 325–337.
Available at https://doi.org/10.1007/978-3-319-53733-7_24.
Giovanni Casu & G. Michele Pinna (2017):
Petri nets and dynamic causality for service-oriented computations.
In: Ahmed Seffah, Birgit Penzenstadler, Carina Alves & Xin Peng: SAC 2017 Conference Proceedings.
ACM,
pp. 1326–1333.
Available at http://doi.acm.org/10.1145/3019612.3019806.
Pierpaolo Degano, José Meseguer & Ugo Montanari (1989):
Axiomatizing Net Computations and Processes.
In: Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), Pacific Grove, California, USA, June 5-8, 1989.
IEEE Computer Society,
pp. 175–185.
Available at https://doi.org/10.1109/LICS.1989.39172.
Pierpaolo Degano, José Meseguer & Ugo Montanari (1996):
Axiomatizing the Algebra of Net Computations and Processes.
AI 33(7),
pp. 641–667.
Available at https://doi.org/10.1007/BF03036469.
Joost Engelfriet (1991):
Branching Processes of Petri Nets.
Acta Informatica 28(6),
pp. 575–591.
Available at https://doi.org/10.1007/BF01463946.
Eric Fabre (2007):
Trellis Processes : A Compact Representation for Runs of Concurrent Systems.
Discrete Event Dynamic Systems 17(3),
pp. 267–306.
Available at https://doi.org/10.1007/s10626-006-0001-0.
Ursula Goltz & Wolfgang Reisig (1983):
The Non-sequential Behavior of Petri Nets.
Information and Control 57(2/3),
pp. 125–147.
Available at https://doi.org/10.1016/S0019-9958(83)80040-0.
Stefan Haar, Christian Kern & Stefan Schwoon (2013):
Computing the reveals relation in occurrence nets.
Theoretical Computer Science 493,
pp. 66–79.
Available at http://dx.doi.org/10.1016/j.tcs.2013.04.028.
Victor Khomenko, Alex Kondratyev, Maciej Koutny & Walter Vogler (2006):
Merged Processes: a new condensed representation of Petri net behaviour.
Acta Informatica 43(5),
pp. 307–330.
Available at http://dx.doi.org/10.1007/s00236-006-0023-y.
Victor Khomenko, Maciej Koutny & Walter Vogler (2003):
Canonical prefixes of Petri net unfoldings.
Acta Informatica 40(2),
pp. 95–118.
Available at http://dx.doi.org/10.1007/s00236-003-0122-y.
Kenneth L. McMillan (1993):
Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits.
In: Gregor von Bochmann & David K. Probst: Computer Aided Verification, Fourth International Workshop, CAV '92, Montreal, Canada, June 29 - July 1, 1992, Proceedings,
Lecture Notes in Computer Science 663.
Springer,
pp. 164–177.
Available at http://dx.doi.org/10.1007/3-540-56496-9_14.
Mogens Nielsen, Gordon D. Plotkin & Glynn Winskel (1981):
Petri Nets, Event Structures and Domains, Part 1.
Theoretical Computer Science 13,
pp. 85–108.
Available at https://doi.org/10.1016/0304-3975(81)90112-2.
Einar Smith & Wolfgang Reisig (1987):
The Semantics of a Net is a Net.
In: Klaus Voss, Hartmann J. Genrich & Grzegorz Rozenberg: Concurrency and Nets.
Springer Verlag,
pp. 461–479.
Available at https://doi.org/10.1007/978-3-642-72822-8_29.
Rob J. van Glabbeek & Gordon D. Plotkin (2009):
Configuration structures, event structures and Petri nets.
Theoretical Computer Science 410(41),
pp. 4111–4159.
Available at https://doi.org/10.1016/j.tcs.2009.06.014.
Glynn Winskel (1987):
Event Structures.
In: Wilfried Brauer, Wolfgang Reisig & Grzegorz Rozenberg: Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986, Part II, Proceedings of an Advanced Course, Bad Honnef, 8.-19. September 1986,
Lecture Notes in Computer Science 255.
Springer Verlag,
pp. 325–392.
Available at https://doi.org/10.1007/3-540-17906-2_31.