<bibliography>
 <citation type="inproceedings" key="nbSqPO2019">
  <author>Nicolas <surname>Behr</surname></author>
  <year>2019</year>
  <title>Sesqui-Pushout Rewriting: Concurrency, Associativity and Rule Algebra Framework</title>
  <editor>Rachid <surname>Echahed</surname></editor>
  <editor>Detlef <surname>Plump</surname></editor>
  <booktitle>Proceedings of the Tenth International Workshop on Graph Computation Models (GCM 2019) in Eindhoven, The Netherlands</booktitle>
  <series>Electronic Proceedings in Theoretical Computer Science</series>
  <volume>309</volume>
  <publisher>Open Publishing Association</publisher>
  <pages>23&#8211;52</pages>
  <doi>10.4204/eptcs.309.2</doi>
 </citation>
 <citation type="inproceedings" key="behr2019tracelets">
  <author>Nicolas <surname>Behr</surname></author>
  <year>2020</year>
  <title>Tracelets and Tracelet Analysis Of Compositional Rewriting Systems</title>
  <editor>John <surname>Baez</surname></editor>
  <editor>Bob <surname>Coecke</surname></editor>
  <booktitle>Proceedings Applied Category Theory 2019, University of Oxford, UK, 15&#8211;19 July 2019</booktitle>
  <series>Electronic Proceedings in Theoretical Computer Science</series>
  <volume>323</volume>
  <publisher>Open Publishing Association</publisher>
  <pages>44&#8211;71</pages>
  <doi>10.4204/EPTCS.323.4</doi>
 </citation>
 <citation type="inproceedings" key="Behr2021">
  <author>Nicolas <surname>Behr</surname></author>
  <year>2021</year>
  <title>On Stochastic Rewriting and Combinatorics via Rule-Algebraic Methods</title>
  <booktitle>Proceedings of TERMGRAPH 2020</booktitle>
  <volume>334</volume>
  <pages>11&#8211;28</pages>
  <doi>10.4204/eptcs.334.2</doi>
 </citation>
 <citation type="inproceedings" key="bdg2016">
  <author>Nicolas <surname>Behr</surname></author>
  <author>Vincent <surname>Danos</surname></author>
  <author>Ilias <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="bdgh2016">
  <author>Nicolas <surname>Behr</surname></author>
  <author>Vincent <surname>Danos</surname></author>
  <author>Ilias <surname>Garnier</surname></author>
  <author>Tobias <surname>Heindel</surname></author>
  <year>2016</year>
  <title>The algebras of graph rewriting</title>
  <journal>arXiv preprint arXiv:1612.06240</journal>
 </citation>
 <citation type="article" key="Behr2021compositionality">
  <author>Nicolas <surname>Behr</surname></author>
  <author>Jean <surname>Krivine</surname></author>
  <year>2021</year>
  <title>Compositionality of Rewriting Rules with Conditions</title>
  <journal>Compositionality</journal>
  <volume>3</volume>
  <doi>10.32408/compositionality-3-2</doi>
 </citation>
 <citation type="article" key="BKAM2021">
  <author>Nicolas <surname>Behr</surname></author>
  <author>Jean <surname>Krivine</surname></author>
  <author>Jakob L. <surname>Andersen</surname></author>
  <author>Daniel <surname>Merkle</surname></author>
  <year>2021</year>
  <title>Rewriting theory for the life sciences: A unifying theory of CTMC semantics</title>
  <journal>Theoretical Computer Science</journal>
  <volume>884</volume>
  <pages>68&#8211;115</pages>
  <doi>10.1016/j.tcs.2021.07.026</doi>
 </citation>
 <citation type="inproceedings" key="bp2018">
  <author>Nicolas <surname>Behr</surname></author>
  <author>Pawel <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>Nicolas <surname>Behr</surname></author>
  <author>Pawel <surname>Sobocinski</surname></author>
  <year>2020</year>
  <title>Rule Algebras for Adhesive Categories (extended journal version)</title>
  <journal>Logical Methods in Computer Science</journal>
  <volume>Volume 16, Issue 3</volume>
  <url>https://lmcs.episciences.org/6615</url>
 </citation>
 <citation type="article" key="Boutillier:2018aa">
  <author>Pierre <surname>Boutillier</surname></author>
  <year>2018</year>
  <title>The Kappa platform for rule-based modeling</title>
  <journal>Bioinformatics</journal>
  <volume>34</volume>
  <number>13</number>
  <pages>i583&#8211;i592</pages>
  <doi>10.1093/bioinformatics/bty272</doi>
 </citation>
 <citation type="article" key="Braatz:2010aa">
  <author>Benjamin <surname>Braatz</surname></author>
  <author>Hartmut <surname>Ehrig</surname></author>
  <author>Karsten <surname>Gabriel</surname></author>
  <author>Ulrike <surname>Golas</surname></author>
  <year>2014</year>
  <title>Finitary M -adhesive categories</title>
  <journal>Mathematical Structures in Computer Science</journal>
  <volume>24</volume>
  <number>4</number>
  <pages>240403&#8211;240443</pages>
  <doi>10.1017/S0960129512000321</doi>
 </citation>
 <citation type="book" key="Dyckerhoff-Kapranov12123563">
  <author>Tobias <surname>Dyckerhoff</surname></author>
  <author>Mikhail <surname>Kapranov</surname></author>
  <year>2019</year>
  <title>Higher Segal spaces</title>
  <series>Lecture Notes in Mathematics</series>
  <volume>2244</volume>
  <publisher>Springer-Verlag</publisher>
  <doi>10.1007/978-3-030-27124-4_1</doi>
 </citation>
 <citation type="article" key="ehrig:2006aa">
  <author>H. <surname>Ehrig</surname></author>
  <author>K. <surname>Ehrig</surname></author>
  <author>U. <surname>Prange</surname></author>
  <author>G. <surname>Taentzer</surname></author>
  <year>2006</year>
  <title>Fundamentals of Algebraic Graph Transformation</title>
  <journal>Monographs in Theoretical Computer Science. An EATCS Series</journal>
  <doi>10.1007/3-540-31188-2</doi>
 </citation>
 <citation type="article" key="ehrig2014mathcal">
  <author>Hartmut <surname>Ehrig</surname></author>
  <author>Ulrike <surname>Golas</surname></author>
  <author>Annegret <surname>Habel</surname></author>
  <author>Leen <surname>Lambers</surname></author>
  <author>Fernando <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="Galvez-Kock-Tonks161209225">
  <author>Imma <surname>G&#225;lvez-Carrillo</surname></author>
  <author>Joachim <surname>Kock</surname></author>
  <author>Andrew <surname>Tonks</surname></author>
  <year>2016</year>
  <title>Decomposition spaces in combinatorics</title>
  <note>Preprint, arXiv:1612.09225</note>
 </citation>
 <citation type="article" key="Galvez-Kock-Tonks151207573">
  <author>Imma <surname>G&#225;lvez-Carrillo</surname></author>
  <author>Joachim <surname>Kock</surname></author>
  <author>Andrew <surname>Tonks</surname></author>
  <year>2018</year>
  <title>Decomposition spaces, incidence algebras and M&#246;bius inversion I: Basic theory</title>
  <journal>Adv. Math.</journal>
  <volume>331</volume>
  <pages>952&#8211;1015</pages>
  <doi>10.1016/j.aim.2018.03.016</doi>
 </citation>
 <citation type="article" key="Galvez-Kock-Tonks151207577">
  <author>Imma <surname>G&#225;lvez-Carrillo</surname></author>
  <author>Joachim <surname>Kock</surname></author>
  <author>Andrew <surname>Tonks</surname></author>
  <year>2018</year>
  <title>Decomposition spaces, incidence algebras and M&#246;bius inversion II: Completeness, length filtration, and finiteness</title>
  <journal>Adv. Math.</journal>
  <volume>333</volume>
  <pages>1242&#8211;1292</pages>
  <doi>10.1016/j.aim.2018.03.017</doi>
 </citation>
 <citation type="article" key="Galvez-Kock-Tonks170802570">
  <author>Imma <surname>G&#225;lvez-Carrillo</surname></author>
  <author>Joachim <surname>Kock</surname></author>
  <author>Andrew <surname>Tonks</surname></author>
  <year>2020</year>
  <title>Decomposition spaces and restriction species</title>
  <journal>Int. Math. Res. Notices</journal>
  <volume>2020</volume>
  <number>21</number>
  <pages>7558&#8211;7616</pages>
  <doi>10.1093/imrn/rny089</doi>
 </citation>
 <citation type="article" key="Hackney-Kock">
  <author>Philip <surname>Hackney</surname></author>
  <author>Joachim <surname>Kock</surname></author>
  <year>2021</year>
  <title>Free decomposition spaces</title>
  <journal>In preparation</journal>
 </citation>
 <citation type="inproceedings" key="ls2004adhesive">
  <author>Stephen <surname>Lack</surname></author>
  <author>Pawe&#322;<surname>Soboci&#324;ski</surname></author>
  <year>2004</year>
  <title>Adhesive Categories</title>
  <editor>Igor <surname>Walukiewicz</surname></editor>
  <booktitle>Foundations of Software Science and Computation Structures (FoSSaCS 2004)</booktitle>
  <series>Lecture Notes in Computer Science</series>
  <volume>2987</volume>
  <publisher>Springer Berlin Heidelberg</publisher>
  <pages>273&#8211;288</pages>
  <doi>10.1007/978-3-540-24727-2_20</doi>
 </citation>
 <citation type="article" key="manchon2008hopf">
  <author>Dominique <surname>Manchon</surname></author>
  <year>2008</year>
  <title>Hopf algebras in renormalisation</title>
  <journal>Handbook of algebra</journal>
  <volume>5</volume>
  <pages>365&#8211;427</pages>
  <doi>10.1016/S1570-7954(07)05007-3</doi>
 </citation>
 <citation type="article" key="RotaMoebius">
  <author>Gian-Carlo <surname>Rota</surname></author>
  <year>1964</year>
  <title>On the foundations of combinatorial theory. I. Theory of M&#246;bius functions</title>
  <journal>Z. Wahrscheinlichkeitstheorie und Verw. Gebiete</journal>
  <volume>2</volume>
  <pages>340&#8211;368 (1964)</pages>
  <doi>10.1007/BF00531932</doi>
  <url>https://www.maths.ed.ac.uk/~v1ranick/papers/rota1.pdf</url>
 </citation>
</bibliography>
