References

  1. J.L. Andersen, C. Flamm, D. Merkle & P.F. Stadler (2016): A Software Package for Chemically Inspired Graph Transformation. In: Graph Transformation (ICGT 2016), LNCS, 9761, pp. 73–88, doi:10.1007/978-3-319-40530-8_5.
  2. N. Behr (2019): Sesqui-Pushout Rewriting: Concurrency, Associativity and Rule Algebra Framework. In: Proceedings of GCM 2019, EPTCS 309, pp. 23–52, doi:10.4204/eptcs.309.2.
  3. N. Behr, V. Danos & I. Garnier (2016): Stochastic mechanics of graph rewriting. In: Proceedings of LICS '16. ACM Press, doi:10.1145/2933575.2934537.
  4. N. Behr, V. Danos & I. Garnier (2020): Combinatorial Conversion and Moment Bisimulation for Stochastic Rewriting Systems. LMCS 16, Issue 3. Available at https://lmcs.episciences.org/6628.
  5. N. Behr, G. Dattoli, Gérard H.E. Duchamp, S. Licciardi & K.A. Penson (2019): Operational Methods in the Study of Sobolev-Jacobi Polynomials. Mathematics 7(2), pp. 124, doi:10.3390/math7020124.
  6. N. Behr & J. Krivine (2019): Compositionality of Rewriting Rules with Conditions. arXiv:1904.09322.
  7. N. Behr & J. Krivine (2020): Rewriting theory for the life sciences: A unifying framework for CTMC semantics. In: Graph Transformation (ICGT 2020), LNCS 12150, doi:10.1007/978-3-030-51372-6.
  8. N. Behr, R. Heckel & M. Ghaffari Saadat (2020): Efficient Computation of Graph Overlaps for Rule Composition: Theory and Z3 Prototyping. In: Proceedings of GCM 2020, EPTCS 330, pp. 126–144, doi:10.4204/EPTCS.330.8.
  9. N. Behr & P. Sobocinski (2018): Rule Algebras for Adhesive Categories. In: Proceedings of CSL 2018, LIPIcs 119, pp. 11:1–11:21, doi:10.4230/LIPIcs.CSL.2018.11.
  10. N. Behr & P. Sobocinski (2020): Rule Algebras for Adhesive Categories (extended journal version). LMCS Volume 16, Issue 3. Available at https://lmcs.episciences.org/6615.
  11. F. Bergeron, G. Labelle & P. Leroux (1997): Combinatorial Species and Tree-like Structures. Encyclopedia of Mathematics and its Applications, doi:10.1017/CBO9781107325913.
  12. F. Bergeron, G. Labelle & P. Leroux (2013): Introduction to the Theory of Species of Structures. Available at http://bergeron.math.uqam.ca/wp-content/uploads/2013/11/book.pdf.
  13. P. Boutillier, M. Maasha, X. Li, H.F. Medina-Abarca, J. Krivine, J. Feret, I. Cristescu, A.G .Forbes & W. Fontana (2018): The Kappa platform for rule-based modeling. Bioinformatics 34(13), pp. i583–i592, doi:10.1093/bioinformatics/bty272.
  14. B. Braatz, H. Ehrig, K. Gabriel & U. Golas (2014): Finitary M -adhesive categories. MSCS 24(4), pp. 240403–240443, doi:10.1017/S0960129512000321.
  15. A. Corradini, T. Heindel, F. Hermann & B. König (2006): Sesqui-Pushout Rewriting. In: Graph Transformations (ICGT 2006), LNCS 4178, pp. 30–45, doi:10.1007/11841883_4.
  16. V. Danos, R. Heckel & P. Sobocinski (2014): Transformation and Refinement of Rigid Structures. In: Graph Transformation (ICGT 2014), LNCS 8571, pp. 146–160, doi:10.1007/978-3-319-09108-2_10.
  17. H. Ehrig, K. Ehrig, U. Prange & G. Taentzer (2006): Fundamentals of Algebraic Graph Transformation. Monographs in Theoretical Computer Science. An EATCS Series, doi:10.1007/3-540-31188-2.
  18. H. Ehrig, U. Golas, A. Habel, L. Lambers & F. Orejas (2014): M-adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation. MSCS 24(04), doi:10.1017/s0960129512000357.
  19. P. Flajolet & R. Sedgewick (2009): Analytic Combinatorics. Cambridge University Press, doi:10.1017/cbo9780511801655.
  20. D.T. Gillespie (1977): Exact stochastic simulation of coupled chemical reactions. The Journal of Physical Chemistry 81(25), pp. 2340–2361, doi:10.1021/j100540a008.
  21. A. Habel & K.-H. Pennemann (2009): Correctness of high-level transformation systems relative to nested conditions. MSCS 19(02), pp. 245, doi:10.1017/s0960129508007202.
  22. A. Joyal (1981): Une théorie combinatoire des séries formelles. Advances in Mathematics 42(1), pp. 1–82, doi:10.1016/0001-8708(81)90052-9.
  23. J.R. Norris (1998): Markov Chains. Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press.
  24. J.-L. Rémy (1985): Un procédé itératif de dénombrement d'arbres binaires et son application à leur génération aléatoire. RAIRO. Informatique théorique 19(2), pp. 179–195, doi:10.1051/ita/1985190201791.
  25. E.S. Rowland (2010): Pattern avoidance in binary trees. Journal of Combinatorial Theory, Series A 117(6), pp. 741–758, doi:10.1016/j.jcta.2010.03.004.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org