W.M.P.v. Aalst (1998):
The application of Petri nets to workflow management.
J. of Circuits, Systems and Computers 8,
pp. 21–66,
doi:10.1142/S0218126698000043.
P.A. Abdulla, A. Bouajjani & J. d'Orso (2003):
Deciding Monotonic Games.
In: Proc. CSL,
LNCS 2803.
Springer-Verlag,
pp. 1–14,
doi:10.1007/978-3-540-45220-1_1.
R. Alur, T.A. Henzinger & O. Kupferman (2002):
Alternating-time temporal logic.
Journal of the ACM 49(5),
pp. 672–713,
doi:10.1145/585265.585270.
U. Buy, H. Darabi, M. Lehene & V. Venepally (2005):
Supervisory Control of Time Petri Nets Using Net Unfolding.
Annual International Computer Software and Applications Conference 2,
pp. 97–100,
doi:10.1109/COMPSAC.2005.148.
J. Engelfriet (1991):
Branching processes of Petri nets.
Acta Informatica 28(6),
pp. 575–591,
doi:10.1007/BF01463946.
J. Esparza (1994):
Model checking using net unfoldings.
Science of Computer Programming 23,
pp. 151–195,
doi:10.1016/0167-6423(94)00019-0.
J. Esparza & K. Heljanko (2008):
Unfoldings – A Partial-Order Approach to Model Checking.
Springer,
doi:10.1007/978-3-540-77426-6.
B. Finkbeiner & S. Schewe (2005):
Uniform Distributed Synthesis.
In: Proc. LICS.
IEEE Computer Society Press,
pp. 321–330,
doi:10.1109/LICS.2005.53.
P. Gastin, B. Lerman & M. Zeitoun (2004):
Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems.
In: Proc. FSTTCS,
pp. 275–286,
doi:10.1007/978-3-540-30538-5_23.
B. Genest, H. Gimbert, A. Muscholl & I. Walukiewicz (2013):
Asynchronous Games over Tree Architectures.
In: Proc. ICALP'13, Part II,
LNCS 7966.
Springer,
pp. 275–286,
doi:10.1007/978-3-642-39212-2_26.
A. Giua (1992):
Petri Nets as Discrete Event Models for Supervisory Control.
Rensselaer Polytechnic Institute.
V. Khomenko, M. Koutny & W. Vogler (2003):
Canonical prefixes of Petri net unfoldings.
Acta Informatica 40,
pp. 95–118,
doi:10.1007/3-540-45657-0_49.
O. Kupferman & M.Y. Vardi (2001):
Synthesizing Distributed Systems.
In: Proc. LICS.
IEEE Computer Society Press,
pp. 389–398,
doi:10.1109/LICS.2001.932514.
P. Madhusudan, P.S. Thiagarajan & S. Yang (2005):
The MSO Theory of Connectedly Communicating Processes.
In: Proc. FSTTCS'05,
LNCS 3821.
Springer,
pp. 201–212,
doi:10.1007/11590156_16.
E.W. Mayr (1981):
An algorithm for the general Petri net reachability problem.
In: Proc. 13th ACM STOC.
ACM,
pp. 238–246,
doi:10.1145/800076.802477.
J. Meseguer, U. Montanari & V. Sassone (1996):
Process versus unfolding semantics for Place/Transition Petri nets.
TCS 153,
pp. 171–210,
doi:10.1016/0304-3975(95)00121-2.
M. Nielsen, G.D. Plotkin & G. Winskel (1981):
Petri Nets, Event Structures and Domains, Part I.
Theor. Comput. Sci. 13,
pp. 85–108,
doi:10.1016/0304-3975(81)90112-2.
E.R. Olderog (1991):
Nets, Terms and Formulas: Three Views of Concurrent Processes and Their Relationship.
Cambridge University Press,
doi:10.1017/CBO9780511526589.
A. Pnueli & R. Rosner (1990):
Distributed Reactive Systems are Hard to Synthesize.
In: Proc. FOCS.
IEEE Computer Society Press,
pp. 746–757,
doi:10.1109/FSCS.1990.89597.
J.F. Raskin, M. Samuelides & L.V. Begin (2003):
Petri Games are Monotone but Difficult to Decide.
Technical Report.
Université Libre De Bruxelles.
R. Rosner (1992):
Modular Synthesis of Reactive Systems.
Weizmann Institute of Science, Rehovot, Israel.
L.J. Stockmeyer & A.K. Chandra (1979):
Provably Difficult Combinatorial Games.
SIAM J. Comput. 8(2),
pp. 151–174,
doi:10.1137/0208013.
I. Walukiewicz & S. Mohalik (2003):
Distributed Games.
In: Proc. FSTTCS'03,
LNCS 2914,
pp. 338–351,
doi:10.1007/978-3-540-24597-1_29.
Q. Zhou, M. Wang & S.P. Dutta (1995):
Generation of optimal control policy for flexible manufacturing cells: A Petri net approach.
Intern. Journal of Advanced Manufacturing Technology 10,
pp. 59–65,
doi:10.1007/BF01184279.
W. Zielonka (1995):
Asynchronous Automata.
In: G. Rozenberg & V. Diekert: Book of Traces.
World Scientific,
pp. 205–248,
doi:10.1142/9789814261456_0007.
eptcs@eptcs.org