{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:54:34Z","timestamp":1740099274565,"version":"3.37.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030047702"},{"type":"electronic","value":"9783030047719"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-04771-9_33","type":"book-chapter","created":{"date-parts":[[2018,12,5]],"date-time":"2018-12-05T22:02:53Z","timestamp":1544047373000},"page":"463-478","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["From Hyperedge Replacement Grammars to Decidable Hyperedge Replacement Games"],"prefix":"10.1007","author":[{"given":"Christoph","family":"Peuser","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,6]]},"reference":[{"key":"33_CR1","unstructured":"Alabdullatif, M., Heckel, R.: Graph transformation games for negotiating features. In: Graph Computation Models (GCM 2016) (2016)"},{"key":"33_CR2","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-642-59136-5_3","volume-title":"Handbook of Formal Languages","author":"Jean-Michel Autebert","year":"1997","unstructured":"Autebert, J.M., Berstel, J., Boasson, L.: Context-free languages and pushdown-automata. In: Handbook of Formal Languages, vol. 1: Word Language Grammar, pp. 111\u2013172. Berlin (1997)"},{"key":"33_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-71998-4_1","volume-title":"Recent Trends in Algebraic Development Techniques","author":"P Baldan","year":"2007","unstructured":"Baldan, P., Corradini, A., K\u00f6nig, B., Lluch Lafuente, A.: A temporal graph logic for verification of graph transformation systems. In: Fiadeiro, J.L., Schobbens, P.-Y. (eds.) WADT 2006. LNCS, vol. 4409, pp. 1\u201320. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71998-4_1"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Drewes, F., Habel, A., Kreowski, H.J.: Hyperedge replacement graph grammars. In: Handbook of Graph Grammars and Computing by Graph Transformation, vol. 1, pp. 95\u2013162. World Scientific (1997)","DOI":"10.1142\/9789812384720_0002"},{"issue":"1","key":"33_CR5","first-page":"31","volume":"74","author":"H Ehrig","year":"2006","unstructured":"Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamental theory of typed attributed graph transformation based on adhesive HLR categories. Fundamenta Informaticae 74(1), 31\u201361 (2006)","journal-title":"Fundamenta Informaticae"},{"key":"33_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36387-4","volume-title":"Automata Logics, and Infinite Games","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata Logics, and Infinite Games. LNCS, vol. 2500. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36387-4"},{"key":"33_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0013875","volume-title":"Hyperedge Replacement: Grammars and Languages","author":"A Habel","year":"1992","unstructured":"Habel, A.: Hyperedge Replacement: Grammars and Languages. LNCS, vol. 643. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/BFb0013875"},{"key":"33_CR8","first-page":"245","volume":"19","author":"A Habel","year":"2009","unstructured":"Habel, A., Pennemann, K.H.: Correctness of high-level transformation systems relative to nested conditions. MSCS 19, 245\u2013296 (2009)","journal-title":"MSCS"},{"key":"33_CR9","series-title":"Addison-Wesley Series in Computer Science","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"JE Hopcroft","year":"2001","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Series in Computer Science, 2nd edn. Addison-Wesley-Longman, Boston (2001)","edition":"2"},{"key":"33_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-642-03816-7_36","volume-title":"Mathematical Foundations of Computer Science 2009","author":"\u0141 Kaiser","year":"2009","unstructured":"Kaiser, \u0141.: Synthesis for structure rewriting systems. In: Kr\u00e1lovi\u010d, R., Niwi\u0144ski, D. (eds.) MFCS 2009. LNCS, vol. 5734, pp. 415\u2013426. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03816-7_36"},{"issue":"7","key":"33_CR11","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1145\/360248.360251","volume":"19","author":"RM Keller","year":"1976","unstructured":"Keller, R.M.: Formal verification of parallel programs. Commun. ACM 19(7), 371\u2013384 (1976)","journal-title":"Commun. ACM"},{"key":"33_CR12","doi-asserted-by":"crossref","unstructured":"Peuser, C.: From hyperedge replacement grammars to decidable hyperedge replacement games. In: Graph Computation Models (GCM 2018) (2018, Preproceedings). https:\/\/www.gcm2018.uni-bremen.de\/assets\/gcm_2018_paper_10.pdf","DOI":"10.1007\/978-3-030-04771-9_33"},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, pp. 46\u201357. IEEE Computer Society (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"33_CR14","unstructured":"Poskitt, C.M., Plump, D.: Verifying total correctness of graph programs. Electron. Commun. EASST 61 (2013). https:\/\/journal.ub.tu-berlin.de\/eceasst\/article\/view\/827"},{"key":"33_CR15","unstructured":"Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: Proceedings of the First Symposium on Logic in Computer Science, pp. 322\u2013331. IEEE Computer Society (1986)"},{"issue":"2","key":"33_CR16","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.2000.2894","volume":"164","author":"I Walukiewicz","year":"2001","unstructured":"Walukiewicz, I.: Pushdown processes: Games and model-checking. Inf. Comput. 164(2), 234\u2013263 (2001)","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Software Technologies: Applications and Foundations"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04771-9_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,7]],"date-time":"2022-09-07T18:07:36Z","timestamp":1662574056000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-04771-9_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030047702","9783030047719"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04771-9_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"STAF","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Federation of International Conferences on Software Technologies: Applications and Foundations","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toulouse","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"staf2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.staf2018.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}