Parosh Aziz Abdulla, Karlis Cerans, Bengt Jonsson & Yih-Kuen Tsay (1996):
General Decidability Theorems for Infinite-State Systems.
In: Proc. LICS 1996.
IEEE Computer Society Press,
pp. 313–321,
doi:10.1109/LICS.1996.561359.
Paolo Baldan, Andrea Corradini, Fabio Gadducci & Ugo Montanari (2010):
From Petri Nets to Graph Transformation Systems.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol. 26,
doi:10.14279/tuj.eceasst.26.368.
Andrea Corradini, Luciana Foss & Leila Ribeiro (2008):
Graph Transformation with Dependencies for the Specification of Interactive Systems.
In: Proc. WADT 2008,
LNCS 5486.
Springer,
pp. 102–118,
doi:10.1007/978-3-642-03429-9_8.
Guoli Ding (1992):
Subgraphs and well-quasi-ordering.
J. Graph Theory 16(5),
pp. 489–502,
doi:10.1002/jgt.3190160509.
Hartmut Ehrig, Karsten Ehrig, Ulrike Prange & Gabriele Taentzer (2006):
Fundamentals of Algebraic Graph Transformation.
Monographs in Theoretical Computer Science. An EATCS Series.
Springer,
doi:10.1007/3-540-31188-2.
Hartmut Ehrig, Reiko Heckel, Martin Korff, Michael Löwe, Leila Ribeiro, Annika Wagner & Andrea Corradini (1997):
Algebraic Approaches to Graph Transformation - Part II: Single Pushout Approach and Comparison with Double Pushout Approach.
In: Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations.
World Scientific,
pp. 247–312,
doi:10.1142/9789812384720_0004.
Javier Esparza & Mogens Nielsen (1994):
Decidability Issues for Petri Nets.
BRICS Report Series 1(8),
doi:10.7146/brics.v1i8.21662.
Alain Finkel & Philippe Schnoebelen (2001):
Well-structured transition systems everywhere!.
Theor. Comput. Sci. 256(1-2),
pp. 63–92,
doi:10.1016/S0304-3975(00)00102-X.
Annegret Habel & Karl-Heinz Pennemann (2009):
Correctness of high-level transformation systems relative to nested conditions.
Math. Struct. Comput. Sci. 19(2),
pp. 245–296,
doi:10.1017/S0960129508007202.
Barbara König & Jan Stückrath (2017):
Well-structured graph transformation systems.
Inf. Comput. 252,
pp. 71–94,
doi:10.1016/j.ic.2016.03.005.
Michael Löwe (1991):
Extended algebraic graph transformation.
Technical University of Berlin, Germany.
Available at http://d-nb.info/910935696.
Okan Özkan (2020):
Modeling Adverse Conditions in the Framework of Graph Transformation Systems.
In: Proc. GCM@STAF 2020,
EPTCS 330,
pp. 35–54,
doi:10.4204/EPTCS.330.3.
Subhav Pradhan, Abhishek Dubey, Tihamer Levendovszky, Pranav Srinivas Kumar, William A. Emfinger, Daniel Balasubramanian, William Otte & Gabor Karsai (2016):
Achieving resilience in distributed software systems via self-reconfiguration.
Journal of Systems and Software 122,
pp. 344–363,
doi:10.1016/j.jss.2016.05.038.
Wolfgang Reisig (1985):
Petri Nets: An Introduction.
EATCS Monographs on Theoretical Computer Science 4.
Springer,
doi:10.1007/978-3-642-69968-9.
Arend Rensink (2004):
Representing First-Order Logic Using Graphs.
In: Proc. ICGT 2004,
LNCS 3256.
Springer,
pp. 319–335,
doi:10.1007/978-3-540-30203-2_23.
Craig G. Rieger, Kevin L. Moore & Thomas L. Baldwin (2013):
Resilient control systems: A multi-agent dynamic systems perspective.
In: Proc. EIT 2013.
IEEE,
pp. 1–16,
doi:10.1109/EIT.2013.6632721.
Neil Robertson & Paul D. Seymour (2004):
Graph Minors. XX. Wagner's conjecture.
J. Comb. Theory, Ser. B 92(2),
pp. 325–357,
doi:10.1016/j.jctb.2004.08.001.
Wolfgang Thomas (1990):
Automata on Infinite Objects.
In: Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics.
Elsevier and MIT Press,
pp. 133–191,
doi:10.1016/b978-0-444-88074-1.50009-3.
Kishor S. Trivedi, Dong Seong Kim & Rahul Ghosh (2009):
Resilience in computer systems and networks.
In: Proc. ICCAD 2009.
ACM,
pp. 74–77,
doi:10.1145/1687399.1687415.
Rüdiger Valk & Matthias Jantzen (1985):
The Residue of Vector Sets with Applications to Decidability Problems in Petri Nets.
Act. Inf. 21,
pp. 643–674,
doi:10.1007/BF00289715.
Xiaoling Zhang, Qiang Lu & Teresa Wu (2009):
Petri-net based application for supply chain management: An overview.
In: Proc. IEEM 2009,
pp. 1406–1410,
doi:10.1109/IEEM.2009.5373050.