References

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