{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T04:45:55Z","timestamp":1782535555077,"version":"3.54.5"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032297297","type":"print"},{"value":"9783032297303","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-29730-3_9","type":"book-chapter","created":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T04:04:52Z","timestamp":1782533092000},"page":"166-183","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["From Graph Rewriting to\u00a0Markov Automata: Mass-Action Semantics for\u00a0Stochastic and\u00a0Probabilistic Systems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4719-0772","authenticated-orcid":false,"given":"Reiko","family":"Heckel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Neel Vinod","family":"Lad","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,28]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-642-16145-2_9","volume-title":"Model Driven Engineering Languages and Systems","author":"T Arendt","year":"2010","unstructured":"Arendt, T., Biermann, E., Jurack, S., Krause, C., Taentzer, G.: Henshin: advanced concepts and tools for in-place EMF model transformations. In: Petriu, D.C., Rouquette, N., Haugen, \u00d8. (eds.) MODELS 2010. LNCS, vol. 6394, pp. 121\u2013135. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16145-2_9"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Baier, C., Hermanns, H., Katoen, J.P., Haverkort, B.R.: Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes. Theor. Comput. Sci. 345(1), 2\u201326 (2005). https:\/\/www.sciencedirect.com\/science\/article\/pii\/S030439750500383X. Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2004)","DOI":"10.1016\/j.tcs.2005.07.022"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Condon, A.: The complexity of stochastic games. Inf. Comput. 96(2), 203\u2013224 (1992). https:\/\/www.sciencedirect.com\/science\/article\/pii\/089054019290048K","DOI":"10.1016\/0890-5401(92)90048-K"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Deng, Y., Hennessy, M.: On the semantics of Markov automata. Inf. Comput. 222, 139\u2013168 (2013). https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0890540112001514. 38th International Colloquium on Automata, Languages and Programming (ICALP 2011)","DOI":"10.1016\/j.ic.2012.10.010"},{"key":"9_CR5","unstructured":"Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. Monographs in Theoretical Computer Science. An EATCS Series. Springer (2006). https:\/\/d-nb.info\/978015258\/04"},{"key":"9_CR6","doi-asserted-by":"publisher","unstructured":"Ghamarian, A.H., de\u00a0Mol, M., Rensink, A., Zambon, E., Zimakova, M.: Modelling and analysis using GROOVE. STTT 14(1), 15\u201340 (2012). https:\/\/doi.org\/10.1007\/s10009-011-0186-x","DOI":"10.1007\/s10009-011-0186-x"},{"key":"9_CR7","doi-asserted-by":"publisher","unstructured":"Gillespie, D.T.: Exact stochastic simulation of coupled chemical reactions. J. Phys. Chem. 81(25), 2340\u20132361 (1977). https:\/\/doi.org\/10.1021\/j100540a008","DOI":"10.1021\/j100540a008"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Gyapay, S., Heckel, R., Varr\u00f3, D.: Graph transformation with time: causality and logical clocks. In: Corradini, A., Ehrig, H., Kreowski, H.J., Rozenberg, G. (eds.) Graph Transformation, pp. 120\u2013134. Springer, Heidelberg (2002). https:\/\/api.semanticscholar.org\/CorpusID:5469215","DOI":"10.1007\/3-540-45832-8_11"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-030-31423-1_8","volume-title":"Reasoning Web. Explainable Artificial Intelligence","author":"A Hartmanns","year":"2019","unstructured":"Hartmanns, A., Hermanns, H.: A modest Markov automata tutorial. In: Kr\u00f6tzsch, M., Stepanova, D. (eds.) Reasoning Web. Explainable Artificial Intelligence. LNCS, vol. 11810, pp. 250\u2013276. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31423-1_8"},{"key":"9_CR10","unstructured":"Heckel, R., Lajios, G., Menge, S.: Stochastic graph transformation systems. Fundam. Inform. 74(1), 63\u201384 (2006). http:\/\/content.iospress.com\/articles\/fundamenta-informaticae\/fi74-1-04"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Heckel, R., Taentzer, G.: Graph Transformation for Software Engineers - With Applications to Model-Based Development and Domain-Specific Language Engineering. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-43916-3","DOI":"10.1007\/978-3-030-43916-3"},{"key":"9_CR12","doi-asserted-by":"publisher","unstructured":"Hensel, C., Junges, S., Katoen, J., Quatmann, T., Volk, M.: The probabilistic model checker Storm. Int. J. Softw. Tools Technol. Transf. 24(4), 589\u2013610 (2022). https:\/\/doi.org\/10.1007\/s10009-021-00633-z","DOI":"10.1007\/s10009-021-00633-z"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-642-33654-6_21","volume-title":"Graph Transformations","author":"C Krause","year":"2012","unstructured":"Krause, C., Giese, H.: Probabilistic graph transformation systems. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2012. LNCS, vol. 7562, pp. 311\u2013325. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33654-6_21"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Maximova, M., Giese, H., Krause, C.: Probabilistic timed graph transformation systems. J. Logical Algebraic Methods Program. 101, 110\u2013131 (2018). https:\/\/www.sciencedirect.com\/science\/article\/pii\/S2352220817302365","DOI":"10.1016\/j.jlamp.2018.09.003"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Neuh\u00e4u\u00dfer, M.R., Zhang, L.: Time-bounded reachability probabilities in continuous-time Markov decision processes. In: 7th International Conference on Quantitative Evaluation of Systems, QEST 2010, Williamsburg, Virginia, USA, 15\u201318 September 2010, pp. 209\u2013218 (2010). https:\/\/ieeexplore.ieee.org\/document\/5600386","DOI":"10.1109\/QEST.2010.47"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformation.: Vol. 1: Foundations, vol.\u00a01. World Scientific, Singapore (1997). https:\/\/scispace.com\/pdf\/handbook-of-graph-grammars-and-computing-by-graph-2rwjem0eoo.pdf","DOI":"10.1142\/3303"},{"key":"9_CR17","doi-asserted-by":"publisher","unstructured":"Schneider, S., Maximova, M., Giese, H.: Stochastic timed graph transformation systems. In: Boronat, A., Fraser, G. (eds.) Fundamental Approaches to Software Engineering - 28th International Conference, FASE 2025, Held as Part of the International Joint Conferences on Theory and Practice of Software, ETAPS 2025, Hamilton, ON, Canada, 3\u20138 May 2025, Proceedings. Lecture Notes in Computer Science, pp. 188\u2013213. Springer (2025). https:\/\/doi.org\/10.1007\/978-3-031-90900-9_10","DOI":"10.1007\/978-3-031-90900-9_10"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-642-32940-1_26","volume-title":"CONCUR 2012 \u2013 Concurrency Theory","author":"M Timmer","year":"2012","unstructured":"Timmer, M., Katoen, J.-P., van de Pol, J., Stoelinga, M.I.A.: Efficient modelling and generation of Markov automata. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol. 7454, pp. 364\u2013379. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32940-1_26"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-030-51372-6_20","volume-title":"Graph Transformation","author":"C Z\u00f6llner","year":"2020","unstructured":"Z\u00f6llner, C., Barkowsky, M., Maximova, M., Schneider, M., Giese, H.: A simulator for probabilistic timed graph transformation systems with complex large-scale topologies. In: Gadducci, F., Kehrer, T. (eds.) ICGT 2020. LNCS, vol. 12150, pp. 325\u2013334. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51372-6_20"}],"container-title":["Lecture Notes in Computer Science","Graph Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-29730-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T04:05:03Z","timestamp":1782533103000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-29730-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032297297","9783032297303"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-29730-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"28 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"ICGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Graph Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rennes","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icgt2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/icgt-2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}