{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T11:44:01Z","timestamp":1749728641847,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031098420"},{"type":"electronic","value":"9783031098437"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-09843-7_3","type":"book-chapter","created":{"date-parts":[[2022,6,30]],"date-time":"2022-06-30T18:04:44Z","timestamp":1656612284000},"page":"38-57","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Decidability of\u00a0Resilience for\u00a0Well-Structured Graph Transformation Systems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4345-1472","authenticated-orcid":false,"given":"Okan","family":"\u00d6zkan","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,26]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","unstructured":"Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.K.: General decidability theorems for infinite-state systems. In: Proceedings of the LICS 1996, pp. 313\u2013321. IEEE (1996). https:\/\/doi.org\/10.1109\/LICS.1996.561359","DOI":"10.1109\/LICS.1996.561359"},{"key":"3_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4376-0","volume-title":"Verification of Sequential and Concurrent Programs. Texts and Monographs in Computer Science","author":"KR Apt","year":"1991","unstructured":"Apt, K.R., Olderog, E.: Verification of Sequential and Concurrent Programs. Texts and Monographs in Computer Science. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/978-1-4757-4376-0"},{"key":"3_CR3","doi-asserted-by":"publisher","unstructured":"Bertrand, N., Delzanno, G., K\u00f6nig, B., Sangnier, A., St\u00fcckrath, J.: On the decidability status of reachability and coverability in graph transformation systems. In: 23rd International Conference on Rewriting Techniques and Applications (RTA 2012). LIPIcs, vol. 15, pp. 101\u2013116 (2012). https:\/\/doi.org\/10.4230\/LIPIcs.RTA.2012.101","DOI":"10.4230\/LIPIcs.RTA.2012.101"},{"issue":"5","key":"3_CR4","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1002\/jgt.3190160509","volume":"16","author":"G Ding","year":"1992","unstructured":"Ding, G.: Subgraphs and well-quasi-ordering. J. Graph Theory 16(5), 489\u2013502 (1992). https:\/\/doi.org\/10.1002\/jgt.3190160509","journal-title":"J. Graph Theory"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BFb0055044","volume-title":"Automata, Languages and Programming","author":"C Dufourd","year":"1998","unstructured":"Dufourd, C., Finkel, A., Schnoebelen, P.: Reset nets between decidability and undecidability. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 103\u2013115. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055044"},{"key":"3_CR6","series-title":"Monographs in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-31188-2","volume-title":"Fundamentals of Algebraic Graph Transformation","author":"H Ehrig","year":"2006","unstructured":"Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. Monographs in Theoretical Computer Science. An EATCS Series, Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-31188-2"},{"key":"3_CR7","doi-asserted-by":"publisher","unstructured":"Ehrig, H., et al.: Algebraic approaches to graph transformation - part II: single pushout approach and comparison with double pushout approach. In: Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations, pp. 247\u2013312. World Scientific (1997). https:\/\/doi.org\/10.1142\/9789812384720_0004","DOI":"10.1142\/9789812384720_0004"},{"key":"3_CR8","doi-asserted-by":"publisher","unstructured":"Esparza, J., Nielsen, M.: Decidability issues for petri nets. BRICS Rep. Ser. 1(8) (1994). https:\/\/doi.org\/10.7146\/brics.v1i8.21662","DOI":"10.7146\/brics.v1i8.21662"},{"issue":"1\u20132","key":"3_CR9","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theor. Comput. Sci. 256(1\u20132), 63\u201392 (2001). https:\/\/doi.org\/10.1016\/S0304-3975(00)00102-X","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"3_CR10","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1017\/S0960129508007202","volume":"19","author":"A Habel","year":"2009","unstructured":"Habel, A., Pennemann, K.: Correctness of high-level transformation systems relative to nested conditions. Math. Struct. Comput. Sci. 19(2), 245\u2013296 (2009). https:\/\/doi.org\/10.1017\/S0960129508007202","journal-title":"Math. Struct. Comput. Sci."},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1002\/sys.21228","volume":"16","author":"S Jackson","year":"2013","unstructured":"Jackson, S., Ferris, T.L.J.: Resilience principles for engineered systems. Syst. Eng. 16, 152\u2013164 (2013). https:\/\/doi.org\/10.1002\/sys.21228","journal-title":"Syst. Eng."},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.ic.2016.03.005","volume":"252","author":"B K\u00f6nig","year":"2017","unstructured":"K\u00f6nig, B., St\u00fcckrath, J.: Well-structured graph transformation systems. Inf. Comput. 252, 71\u201394 (2017). https:\/\/doi.org\/10.1016\/j.ic.2016.03.005","journal-title":"Inf. Comput."},{"key":"3_CR13","unstructured":"\u00d6zkan, O.: Decidability of resilience for well-structured graph transformation systems. Technical report, Department of Computing Science, University of Oldenburg (2022). https:\/\/uol.de\/fs\/publikationen#c352844"},{"key":"3_CR14","doi-asserted-by":"publisher","unstructured":"\u00d6zkan, O., W\u00fcrdemann, N.: Resilience of well-structured graph transformation systems. In: Proceedings of 12th International Workshop on Graph Computational Models. EPTCS, vol. 350, pp. 69\u201388 (2021). https:\/\/doi.org\/10.4204\/EPTCS.350.5","DOI":"10.4204\/EPTCS.350.5"},{"issue":"1\u20132","key":"3_CR15","doi-asserted-by":"publisher","first-page":"135","DOI":"10.3233\/FI-2012-708","volume":"118","author":"CM Poskitt","year":"2012","unstructured":"Poskitt, C.M., Plump, D.: Hoare-style verification of graph programs. Fundam. Informaticae 118(1\u20132), 135\u2013175 (2012). https:\/\/doi.org\/10.3233\/FI-2012-708","journal-title":"Fundam. Informaticae"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-540-30203-2_23","volume-title":"Graph Transformations","author":"A Rensink","year":"2004","unstructured":"Rensink, A.: Representing first-order logic using graphs. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol. 3256, pp. 319\u2013335. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30203-2_23"},{"key":"3_CR17","doi-asserted-by":"publisher","unstructured":"Trivedi, K.S., Kim, D.S., Ghosh, R.: Resilience in computer systems and networks. In: Proceedings of the ICCAD 2009, pp. 74\u201377. IEEE\/ACM (2009). https:\/\/doi.org\/10.1145\/1687399.1687415","DOI":"10.1145\/1687399.1687415"}],"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-031-09843-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,30]],"date-time":"2022-06-30T18:04:59Z","timestamp":1656612299000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-09843-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031098420","9783031098437"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-09843-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"26 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"Nantes","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icgt2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}