<bibliography>
 <citation type="book" key="Anderson_1991">
  <author>W.J. <surname>Anderson</surname></author>
  <year>1991</year>
  <title>Continuous-Time Markov Chains</title>
  <publisher>Springer New York</publisher>
  <doi>10.1007/978-1-4612-3038-0</doi>
 </citation>
 <citation type="article" key="b2019c">
  <author>N. <surname>Behr</surname></author>
  <year>2019</year>
  <title>Tracelets and Tracelet Analysis Of Compositional Rewriting Systems</title>
  <journal>arXiv preprint arXiv:1904.12829</journal>
 </citation>
 <citation type="inproceedings" key="bdg2016">
  <author>N. <surname>Behr</surname></author>
  <author>V. <surname>Danos</surname></author>
  <author>I. <surname>Garnier</surname></author>
  <year>2016</year>
  <title>Stochastic mechanics of graph rewriting</title>
  <booktitle>Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '16</booktitle>
  <publisher>ACM Press</publisher>
  <doi>10.1145/2933575.2934537</doi>
 </citation>
 <citation type="article" key="bdg2019">
  <author>N. <surname>Behr</surname></author>
  <author>V. <surname>Danos</surname></author>
  <author>I. <surname>Garnier</surname></author>
  <year>2019</year>
  <title>Combinatorial Conversion and Moment Bisimulation for Stochastic Rewriting Systems</title>
  <journal>arXiv preprint 1904.07313</journal>
 </citation>
 <citation type="article" key="bdgh2016">
  <author>N. <surname>Behr</surname></author>
  <author>V. <surname>Danos</surname></author>
  <author>I. <surname>Garnier</surname></author>
  <author>T. <surname>Heindel</surname></author>
  <year>2016</year>
  <title>The algebras of graph rewriting</title>
  <journal>arXiv:1612.06240</journal>
 </citation>
 <citation type="article" key="bdp2017">
  <author>N. <surname>Behr</surname></author>
  <author>G.H.E. <surname>Duchamp</surname></author>
  <author>K.A. <surname>Penson</surname></author>
  <year>2017</year>
  <title>Combinatorics of Chemical Reaction Systems</title>
  <journal>arXiv:1712.06575</journal>
 </citation>
 <citation type="inproceedings" key="bp2018">
  <author>N. <surname>Behr</surname></author>
  <author>P. <surname>Sobocinski</surname></author>
  <year>2018</year>
  <title>Rule Algebras for Adhesive Categories</title>
  <editor>Dan <surname>Ghica</surname></editor>
  <editor>Achim <surname>Jung</surname></editor>
  <booktitle>27th EACSL Annual Conference on Computer Science Logic (CSL 2018)</booktitle>
  <series>Leibniz International Proceedings in Informatics (LIPIcs)</series>
  <volume>119</volume>
  <publisher>Schloss Dagstuhl&#8211;Leibniz-Zentrum fuer Informatik</publisher>
  <address>Dagstuhl, Germany</address>
  <pages>11:1&#8211;11:21</pages>
  <doi>10.4230/LIPIcs.CSL.2018.11</doi>
 </citation>
 <citation type="article" key="bp2019-ext">
  <author>N. <surname>Behr</surname></author>
  <author>P. <surname>Sobocinski</surname></author>
  <year>2019</year>
  <title>Rule Algebras for Adhesive Categories (invited extended journal version)</title>
  <journal>arXiv preprint 1807.00785v2</journal>
 </citation>
 <citation type="article" key="blasiak2005boson">
  <author>P. <surname>Blasiak</surname></author>
  <author>G.H.E. <surname>Duchamp</surname></author>
  <author>A. <surname>Horzela</surname></author>
  <author>K.A. <surname>Penson</surname></author>
  <author>A.I. <surname>Solomon</surname></author>
  <year>2005</year>
  <title>Boson normal ordering via substitutions and Sheffer-Type Polynomials</title>
  <journal>Physics Letters A</journal>
  <volume>338</volume>
  <number>2</number>
  <pages>108&#8211;116</pages>
  <doi>10.1016/j.physleta.2005.02.028</doi>
 </citation>
 <citation type="article" key="blasiak2010combinatorial">
  <author>P. <surname>Blasiak</surname></author>
  <author>G.H.E. <surname>Duchamp</surname></author>
  <author>A. <surname>Horzela</surname></author>
  <author>K.A. <surname>Penson</surname></author>
  <author>A.I. <surname>Solomon</surname></author>
  <year>2010</year>
  <title>Combinatorial Algebra for second-quantized Quantum Theory</title>
  <journal>Advances in Theoretical and Mathematical Physics</journal>
  <volume>14</volume>
  <number>4</number>
  <pages>1209&#8211;1243</pages>
  <doi>10.4310/atmp.2010.v14.n4.a5</doi>
 </citation>
 <citation type="article" key="blasiak2011combinatorial">
  <author>P. <surname>Blasiak</surname></author>
  <author>P. <surname>Flajolet</surname></author>
  <year>2011</year>
  <title>Combinatorial Models of Creation-Annihilation</title>
  <journal>S&#233;minaire Lotharingien de Combinatoire</journal>
  <volume>65</volume>
  <number>B65c</number>
  <pages>1&#8211;78</pages>
 </citation>
 <citation type="inproceedings" key="Braatz:2010aa">
  <author>B. <surname>Braatz</surname></author>
  <author>H. <surname>Ehrig</surname></author>
  <author>K. <surname>Gabriel</surname></author>
  <author>U. <surname>Golas</surname></author>
  <year>2010</year>
  <title>Finitary M -Adhesive Categories</title>
  <editor>H. <surname>Ehrig</surname></editor>
  <editor>A. <surname>Rensink</surname></editor>
  <editor>G. <surname>Rozenberg</surname></editor>
  <editor>A. <surname>Sch&#252;rr</surname></editor>
  <booktitle>Graph Transformations (ICGT 2010)</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>6372</volume>
  <publisher>Springer, Berlin, Heidelberg</publisher>
  <pages>234&#8211;249</pages>
  <doi>10.1007/978-3-642-15928-2_16</doi>
 </citation>
 <citation type="article" key="Cockett_2003">
  <author>J.R.B. <surname>Cockett</surname></author>
  <author>S. <surname>Lack</surname></author>
  <year>2003</year>
  <title>Restriction categories II: partial map classification</title>
  <journal>Theoretical Computer Science</journal>
  <volume>294</volume>
  <number>1-2</number>
  <pages>61&#8211;102</pages>
  <doi>10.1016/s0304-3975(01)00245-6</doi>
 </citation>
 <citation type="inproceedings" key="Corradini_2015">
  <author>A. <surname>Corradini</surname></author>
  <author>D. <surname>Duval</surname></author>
  <author>R. <surname>Echahed</surname></author>
  <author>F. <surname>Prost</surname></author>
  <author>L. <surname>Ribeiro</surname></author>
  <year>2015</year>
  <title>AGREE Algebraic Graph Rewriting with Controlled Embedding</title>
  <editor>Francesco <surname>Parisi-Presicce</surname></editor>
  <editor>Bernhard <surname>Westfechtel</surname></editor>
  <booktitle>Graph Transformation (ICGT 2015)</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>9151</volume>
  <publisher>Springer International Publishing</publisher>
  <address>Cham</address>
  <pages>35&#8211;51</pages>
  <doi>10.1007/978-3-319-21145-9_3</doi>
 </citation>
 <citation type="inproceedings" key="Corradini2018">
  <author>A. <surname>Corradini</surname></author>
  <author>D. <surname>Duval</surname></author>
  <author>M. <surname>L&#246;we</surname></author>
  <author>L. <surname>Ribeiro</surname></author>
  <author>R. <surname>Machado</surname></author>
  <author>A. <surname>Costa</surname></author>
  <author>G. Grochau <surname>Azzi</surname></author>
  <author>J. Santos <surname>Bezerra</surname></author>
  <author>L. Marques <surname>Rodrigues</surname></author>
  <year>2018</year>
  <title>On the Essence of Parallel Independence for the Double-Pushout and Sesqui-Pushout Approaches</title>
  <editor>R. <surname>Heckel</surname></editor>
  <editor>G. <surname>Taentzer</surname></editor>
  <booktitle>Graph Transformation, Specifications, and Nets</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>10800</volume>
  <publisher>Springer International Publishing</publisher>
  <address>Cham</address>
  <pages>1&#8211;18</pages>
  <doi>10.1007/978-3-319-75396-6_1</doi>
 </citation>
 <citation type="inproceedings" key="Corradini_2006">
  <author>A. <surname>Corradini</surname></author>
  <author>T. <surname>Heindel</surname></author>
  <author>F. <surname>Hermann</surname></author>
  <author>B. <surname>K&#246;nig</surname></author>
  <year>2006</year>
  <title>Sesqui-Pushout Rewriting</title>
  <editor>A. <surname>Corradini</surname></editor>
  <editor>H. <surname>Ehrig</surname></editor>
  <editor>U. <surname>Montanari</surname></editor>
  <editor>L. <surname>Ribeiro</surname></editor>
  <editor>G. <surname>Rozenberg</surname></editor>
  <booktitle>Graph Transformations (ICGT 2006)</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>4178</volume>
  <publisher>Springer</publisher>
  <address>Berlin, Heidelberg</address>
  <pages>30&#8211;45</pages>
  <doi>10.1007/11841883_4</doi>
 </citation>
 <citation type="inproceedings" key="DBLP:conf/gg/CorradiniMREHL97">
  <author>A. <surname>Corradini</surname></author>
  <author>U. <surname>Montanari</surname></author>
  <author>F. <surname>Rossi</surname></author>
  <author>H. <surname>Ehrig</surname></author>
  <author>R. <surname>Heckel</surname></author>
  <author>M. <surname>L&#246;we</surname></author>
  <year>1997</year>
  <title>Algebraic Approaches to Graph Transformation - Part I: Basic Concepts and Double Pushout Approach</title>
  <booktitle>Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations</booktitle>
  <publisher>World Scientific</publisher>
  <pages>163&#8211;246</pages>
  <doi>10.1142/9789812384720_0003</doi>
 </citation>
 <citation type="inproceedings" key="danos2012graphs">
  <author>V. <surname>Danos</surname></author>
  <author>J. <surname>Feret</surname></author>
  <author>W. <surname>Fontana</surname></author>
  <author>R. <surname>Harmer</surname></author>
  <author>J. <surname>Hayman</surname></author>
  <author>J. <surname>Krivine</surname></author>
  <author>C. <surname>Thompson-Walsh</surname></author>
  <author>G. <surname>Winskel</surname></author>
  <year>2012</year>
  <title>Graphs, Rewriting and Pathway Reconstruction for Rule-Based Models</title>
  <editor>D. <surname>D'Souza</surname></editor>
  <editor>T. <surname>Kavitha</surname></editor>
  <editor>J. <surname>Radhakrishnan</surname></editor>
  <booktitle>IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012)</booktitle>
  <series>Leibniz International Proceedings in Informatics (LIPIcs)</series>
  <volume>18</volume>
  <publisher>Schloss Dagstuhl&#8211;Leibniz-Zentrum fuer Informatik</publisher>
  <address>Dagstuhl, Germany</address>
  <pages>276&#8211;288</pages>
  <doi>10.4230/LIPIcs.FSTTCS.2012.276</doi>
 </citation>
 <citation type="inproceedings" key="danos2008rule">
  <author>V. <surname>Danos</surname></author>
  <author>J. <surname>Feret</surname></author>
  <author>W. <surname>Fontana</surname></author>
  <author>R. <surname>Harmer</surname></author>
  <author>J. <surname>Krivine</surname></author>
  <year>2008</year>
  <title>Rule-Based Modelling, Symmetries, Refinements</title>
  <editor>Jasmin <surname>Fisher</surname></editor>
  <booktitle>Formal Methods in Systems Biology (FMSB 2008)</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>5054</volume>
  <publisher>Springer</publisher>
  <address>Berlin, Heidelberg</address>
  <pages>103&#8211;122</pages>
  <doi>10.1007/978-3-540-68413-8_8</doi>
 </citation>
 <citation type="inproceedings" key="Danos_2010">
  <author>V. <surname>Danos</surname></author>
  <author>J. <surname>Feret</surname></author>
  <author>W. <surname>Fontana</surname></author>
  <author>R. <surname>Harmer</surname></author>
  <author>J. <surname>Krivine</surname></author>
  <year>2010</year>
  <title>Abstracting the Differential Semantics of Rule-Based Models: Exact and Automated Model Reduction</title>
  <booktitle>2010 25th Annual IEEE Symposium on Logic in Computer Science</booktitle>
  <publisher>IEEE</publisher>
  <doi>10.1109/lics.2010.44</doi>
 </citation>
 <citation type="article" key="danos2004formal">
  <author>V. <surname>Danos</surname></author>
  <author>C. <surname>Laneve</surname></author>
  <year>2004</year>
  <title>Formal molecular biology</title>
  <journal>Theoretical Computer Science</journal>
  <volume>325</volume>
  <number>1</number>
  <pages>69&#8211;110</pages>
  <doi>10.1016/j.tcs.2004.03.065</doi>
 </citation>
 <citation type="article" key="Dattoli:1997iz">
  <author>G. <surname>Dattoli</surname></author>
  <author>P. L. <surname>Ottaviani</surname></author>
  <author>A. <surname>Torre</surname></author>
  <author>L. <surname>Vazquez</surname></author>
  <year>1997</year>
  <title>Evolution operator equations: Integration with algebraic and finite-difference methods: Applications to physical problems in classical and quantum mechanics and quantum field theory</title>
  <journal>Riv. Nuovo Cim.</journal>
  <volume>20N2</volume>
  <pages>1&#8211;133</pages>
  <doi>10.1007/BF02907529</doi>
 </citation>
 <citation type="article" key="EHRIG:2014ma">
  <author>H. <surname>Ehrig</surname></author>
  <author>U. <surname>Golas</surname></author>
  <author>A. <surname>Habel</surname></author>
  <author>L. <surname>Lambers</surname></author>
  <author>F. <surname>Orejas</surname></author>
  <year>2014</year>
  <title>M-adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation</title>
  <journal>Mathematical Structures in Computer Science</journal>
  <volume>24</volume>
  <number>04</number>
  <doi>10.1017/s0960129512000357</doi>
 </citation>
 <citation type="article" key="Ehrig1991">
  <author>H. <surname>Ehrig</surname></author>
  <author>A. <surname>Habel</surname></author>
  <author>H.J. <surname>Kreowski</surname></author>
  <author>F. <surname>Parisi-Presicce</surname></author>
  <year>1991</year>
  <title>Parallelism and concurrency in high-level replacement systems</title>
  <journal>Mathematical Structures in Computer Science</journal>
  <volume>1</volume>
  <number>3</number>
  <pages>361&#8211;404</pages>
  <doi>10.1017/s0960129500001353</doi>
 </citation>
 <citation type="inproceedings" key="ehrig2004adhesive">
  <author>H. <surname>Ehrig</surname></author>
  <author>A. <surname>Habel</surname></author>
  <author>J. <surname>Padberg</surname></author>
  <author>U. <surname>Prange</surname></author>
  <year>2004</year>
  <title>Adhesive High-Level Replacement Categories and Systems</title>
  <editor>H. <surname>Ehrig</surname></editor>
  <editor>G. <surname>Engels</surname></editor>
  <editor>F. <surname>Parisi-Presicce</surname></editor>
  <editor>G. <surname>Rozenberg</surname></editor>
  <booktitle>Graph Transformations (ICGT 2004)</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>3256</volume>
  <publisher>Springer</publisher>
  <address>Berlin, Heidelberg</address>
  <pages>144&#8211;160</pages>
  <doi>10.1007/978-3-540-30203-2_12</doi>
 </citation>
 <citation type="inproceedings" key="Ehrig1973">
  <author>H. <surname>Ehrig</surname></author>
  <author>M. <surname>Pfender</surname></author>
  <author>H. J. <surname>Schneider</surname></author>
  <year>1973</year>
  <title>Graph-grammars: An algebraic approach</title>
  <booktitle>14th Annual Symposium on Switching and Automata Theory (SWAT 1973)</booktitle>
  <publisher>IEEE</publisher>
  <doi>10.1109/swat.1973.11</doi>
 </citation>
 <citation type="article" key="GOLAS2014">
  <author>U. <surname>Golas</surname></author>
  <author>A. <surname>Habel</surname></author>
  <author>H. <surname>Ehrig</surname></author>
  <year>2014</year>
  <title>Multi-amalgamation of rules with application conditions in M-adhesive categories</title>
  <journal>Mathematical Structures in Computer Science</journal>
  <volume>24</volume>
  <number>04</number>
  <doi>10.1017/s0960129512000345</doi>
 </citation>
 <citation type="book" key="hall2015lieGroups">
  <author>B.C. <surname>Hall</surname></author>
  <year>2015</year>
  <title>Lie Groups, Lie Algebras, and Representations</title>
  <publisher>Springer International Publishing</publisher>
  <doi>10.1007/978-3-319-13467-3</doi>
 </citation>
 <citation type="inproceedings" key="Heckel2005">
  <author>R. <surname>Heckel</surname></author>
  <year>2005</year>
  <title>Stochastic Analysis of Graph Transformation Systems: A Case Study in P2P Networks</title>
  <editor>D. Van <surname>Hung</surname></editor>
  <editor>M. <surname>Wirsing</surname></editor>
  <booktitle>Theoretical Aspects of Computing (ICTAC 2005)</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>3722</volume>
  <publisher>Springer</publisher>
  <address>Berlin, Heidelberg</address>
  <pages>53&#8211;69</pages>
  <doi>10.1007/11560647_4</doi>
 </citation>
 <citation type="inproceedings" key="Heckel2012">
  <author>R. <surname>Heckel</surname></author>
  <author>H. <surname>Ehrig</surname></author>
  <author>U. <surname>Golas</surname></author>
  <author>F. <surname>Hermann</surname></author>
  <year>2012</year>
  <title>Parallelism and Concurrency of Stochastic Graph Transformations</title>
  <editor>H. <surname>Ehrig</surname></editor>
  <editor>G. <surname>Engels</surname></editor>
  <editor>H.J. <surname>Kreowski</surname></editor>
  <editor>G. <surname>Rozenberg</surname></editor>
  <booktitle>Graph Transformations (ICGT 2012)</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>7562</volume>
  <publisher>Springer</publisher>
  <address>Berlin, Heidelberg</address>
  <pages>96&#8211;110</pages>
  <doi>10.1007/978-3-642-33654-6_7</doi>
 </citation>
 <citation type="inproceedings" key="Heckel_2004">
  <author>R. <surname>Heckel</surname></author>
  <author>G. <surname>Lajios</surname></author>
  <author>S. <surname>Menge</surname></author>
  <year>2004</year>
  <title>Stochastic Graph Transformation Systems</title>
  <editor>H. <surname>Ehrig</surname></editor>
  <editor>G. <surname>Engels</surname></editor>
  <editor>F. <surname>Parisi-Presicce</surname></editor>
  <editor>G. <surname>Rozenberg</surname></editor>
  <booktitle>Graph Transformations (ICGT 2004)</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>3256</volume>
  <publisher>Springer</publisher>
  <address>Berlin, Heidelberg</address>
  <pages>210&#8211;225</pages>
  <doi>10.1007/978-3-540-30203-2_16</doi>
 </citation>
 <citation type="inproceedings" key="Kennaway">
  <author>R. <surname>Kennaway</surname></author>
  <year>1990</year>
  <title>Graph rewriting in some categories of partial morphisms</title>
  <editor>H. <surname>Ehrig</surname></editor>
  <editor>H.J. <surname>Kreowski</surname></editor>
  <editor>G. <surname>Rozenberg</surname></editor>
  <booktitle>Graph Grammars and Their Application to Computer Science (Graph Grammars 1990)</booktitle>
  <volume>532</volume>
  <publisher>Springer</publisher>
  <address>Berlin, Heidelberg</address>
  <pages>490&#8211;504</pages>
  <doi>10.1007/bfb0017408</doi>
 </citation>
 <citation type="inproceedings" key="Krause2012">
  <author>C. <surname>Krause</surname></author>
  <author>H. <surname>Giese</surname></author>
  <year>2012</year>
  <title>Probabilistic Graph Transformation Systems</title>
  <editor>H. <surname>Ehrig</surname></editor>
  <editor>G. <surname>Engels</surname></editor>
  <editor>H.J. <surname>Kreowski</surname></editor>
  <editor>G. <surname>Rozenberg</surname></editor>
  <booktitle>Graph Transformations (ICGT 2012)</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>7562</volume>
  <publisher>Springer</publisher>
  <address>Berlin, Heidelberg</address>
  <pages>311&#8211;325</pages>
  <doi>10.1007/978-3-642-33654-6_21</doi>
 </citation>
 <citation type="article" key="lack2005adhesive">
  <author>S. <surname>Lack</surname></author>
  <author>P. <surname>Soboci&#324;ski</surname></author>
  <year>2005</year>
  <title>Adhesive and quasiadhesive categories</title>
  <journal>RAIRO - Theoretical Informatics and Applications</journal>
  <volume>39</volume>
  <number>3</number>
  <pages>511&#8211;545</pages>
  <doi>10.1051/ita:2005028</doi>
 </citation>
 <citation type="article" key="Loewe_1993">
  <author>M. <surname>L&#246;we</surname></author>
  <year>1993</year>
  <title>Algebraic approach to single-pushout graph transformation</title>
  <journal>Theoretical Computer Science</journal>
  <volume>109</volume>
  <number>1-2</number>
  <pages>181&#8211;224</pages>
  <doi>10.1016/0304-3975(93)90068-5</doi>
 </citation>
 <citation type="inproceedings" key="Loewe_2015">
  <author>M. <surname>L&#246;we</surname></author>
  <year>2015</year>
  <title>Polymorphic Sesqui-Pushout Graph Rewriting</title>
  <editor>F. <surname>Parisi-Presicce</surname></editor>
  <editor>B. <surname>Westfechtel</surname></editor>
  <booktitle>Graph Transformation (ICGT 2015)</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>9151</volume>
  <publisher>Springer International Publishing</publisher>
  <address>Cham</address>
  <pages>3&#8211;18</pages>
  <doi>10.1007/978-3-319-21145-9_1</doi>
 </citation>
 <citation type="inproceedings" key="Loewe_2018">
  <author>M. <surname>L&#246;we</surname></author>
  <year>2018</year>
  <title>Characterisation of Parallel Independence in AGREE-Rewriting</title>
  <editor>L. <surname>Lambers</surname></editor>
  <editor>J. <surname>Weber</surname></editor>
  <booktitle>Graph Transformation (ICGT 2018)</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>10887</volume>
  <publisher>Springer International Publishing</publisher>
  <address>Cham</address>
  <pages>118&#8211;133</pages>
  <doi>10.1007/978-3-319-92991-0_8</doi>
 </citation>
 <citation type="inproceedings" key="Loewe_2014">
  <author>M. <surname>L&#246;we</surname></author>
  <author>H. <surname>K&#246;nig</surname></author>
  <author>C. <surname>Schulz</surname></author>
  <year>2014</year>
  <title>Polymorphic Single-Pushout Graph Transformation</title>
  <editor>S. <surname>Gnesi</surname></editor>
  <editor>A. <surname>Rensink</surname></editor>
  <booktitle>Fundamental Approaches to Software Engineering (FASE 2014)</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>8411</volume>
  <publisher>Springer</publisher>
  <address>Berlin, Heidelberg</address>
  <pages>355&#8211;369</pages>
  <doi>10.1007/978-3-642-54804-8_25</doi>
 </citation>
 <citation type="article" key="lowe2015single">
  <author>M. <surname>L&#246;we</surname></author>
  <author>M. <surname>Tempelmeier</surname></author>
  <year>2015</year>
  <title>Single-Pushout Rewriting of Partial Algebras</title>
  <journal>GCM 2015 Graph Computation Models</journal>
  <pages>82</pages>
 </citation>
 <citation type="article" key="Maximova2018">
  <author>M. <surname>Maximova</surname></author>
  <author>H. <surname>Giese</surname></author>
  <author>C. <surname>Krause</surname></author>
  <year>2018</year>
  <title>Probabilistic timed graph transformation systems</title>
  <journal>Journal of Logical and Algebraic Methods in Programming</journal>
  <volume>101</volume>
  <pages>110&#8211;131</pages>
  <doi>10.1016/j.jlamp.2018.09.003</doi>
 </citation>
 <citation type="book" key="norris">
  <author>J. R. <surname>Norris</surname></author>
  <year>1997</year>
  <title>Markov Chains</title>
  <publisher>Cambridge University Press</publisher>
  <doi>10.1017/cbo9780511810633</doi>
 </citation>
 <citation type="book" key="DBLP:conf/gg/1997handbook">
  <author>G. <surname>Rozenberg</surname></author>
  <year>1997</year>
  <title>Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations</title>
  <publisher>World Scientific</publisher>
  <doi>10.1142/9789812384720</doi>
 </citation>
</bibliography>
