{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:45:36Z","timestamp":1742913936753,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031505232"},{"type":"electronic","value":"9783031505249"}],"license":[{"start":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T00:00:00Z","timestamp":1703894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T00:00:00Z","timestamp":1703894400000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-50524-9_7","type":"book-chapter","created":{"date-parts":[[2023,12,29]],"date-time":"2023-12-29T15:02:28Z","timestamp":1703862148000},"page":"147-168","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Resilience and\u00a0Home-Space for\u00a0WSTS"],"prefix":"10.1007","author":[{"given":"Alain","family":"Finkel","sequence":"first","affiliation":[]},{"given":"Mathieu","family":"Hilaire","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,30]]},"reference":[{"issue":"1\u20132","key":"7_CR1","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/inco.1999.2843","volume":"160","author":"PA Abdulla","year":"2000","unstructured":"Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.: Algorithmic analysis of programs with well quasi-ordered domains. Inf. Comput. 160(1\u20132), 109\u2013127 (2000). https:\/\/doi.org\/10.1006\/inco.1999.2843","journal-title":"Inf. Comput."},{"issue":"2","key":"7_CR2","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1006\/inco.1996.0053","volume":"127","author":"PA Abdulla","year":"1996","unstructured":"Abdulla, P.A., Jonsson, B.: Verifying programs with unreliable channels. Inf. Comput. 127(2), 91\u2013101 (1996). https:\/\/doi.org\/10.1006\/inco.1996.0053","journal-title":"Inf. Comput."},{"issue":"1","key":"7_CR3","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(76)90067-0","volume":"3","author":"T Araki","year":"1976","unstructured":"Araki, T., Kasami, T.: Some decision problems related to the reachability problem for petri nets. Theoret. Comput. Sci. 3(1), 85\u2013104 (1976)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"7_CR4","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s10703-012-0168-y","volume":"43","author":"N Bertrand","year":"2013","unstructured":"Bertrand, N., Schnoebelen, P.: Computable fixpoints in well-structured symbolic model checking. Formal Methods Syst. Des. 43(2), 233\u2013267 (2013). https:\/\/doi.org\/10.1007\/s10703-012-0168-y","journal-title":"Formal Methods Syst. Des."},{"key":"7_CR5","doi-asserted-by":"publisher","unstructured":"Blondin, M., Finkel, A., Haase, C., Haddad, S.: The logical view on continuous petri nets. ACM Trans. Comput. Log. 18(3), 24:1\u201324:28 (2017). https:\/\/doi.org\/10.1145\/3105908","DOI":"10.1145\/3105908"},{"key":"7_CR6","doi-asserted-by":"publisher","unstructured":"Blondin, M., Finkel, A., McKenzie, P.: Well behaved transition systems. Log. Methods Comput. Sci. 13(3) (2017). https:\/\/doi.org\/10.23638\/LMCS-13(3:24)2017","DOI":"10.23638\/LMCS-13(3:24)2017"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.ic.2017.11.001","volume":"258","author":"M Blondin","year":"2018","unstructured":"Blondin, M., Finkel, A., McKenzie, P.: Handling infinitely branching well-structured transition systems. Inf. Comput. 258, 28\u201349 (2018). https:\/\/doi.org\/10.1016\/j.ic.2017.11.001","journal-title":"Inf. Comput."},{"key":"7_CR8","series-title":"LNCS","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.) Automata, Languages, and Programming. LNCS, vol. 1443, pp. 103\u2013115. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055044"},{"issue":"2","key":"7_CR9","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/0890-5401(90)90009-7","volume":"89","author":"A Finkel","year":"1990","unstructured":"Finkel, A.: Reduction and covering of infinite reachability trees. Inf. Comput. 89(2), 144\u2013179 (1990). https:\/\/doi.org\/10.1016\/0890-5401(90)90009-7","journal-title":"Inf. Comput."},{"key":"7_CR10","doi-asserted-by":"publisher","unstructured":"Finkel, A., Goubault-Larrecq, J.: Forward analysis for WSTS, part II: complete WSTS. Log. Methods Comput. Sci. 8(3) (2012). https:\/\/doi.org\/10.2168\/LMCS-8(3:28)2012","DOI":"10.2168\/LMCS-8(3:28)2012"},{"issue":"1\u20132","key":"7_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2004.01.005","volume":"195","author":"A Finkel","year":"2004","unstructured":"Finkel, A., McKenzie, P., Picaronny, C.: A well-structured framework for analysing petri net extensions. Inf. Comput. 195(1\u20132), 1\u201329 (2004)","journal-title":"Inf. Comput."},{"issue":"1\u20132","key":"7_CR12","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."},{"key":"7_CR13","unstructured":"de Frutos Escrig, D., Johnen, C.: Decidability of home space property. Universit\u00e9 de Paris-Sud. Centre d\u2019Orsay. Laboratoire de Recherche en Informatique, Rapport de recherche n$$^{\\circ }$$503 (1989)"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-319-11439-2_9","volume-title":"Reachability Problems","author":"C Haase","year":"2014","unstructured":"Haase, C., Halfon, S.: Integer vector addition systems with states. In: Ouaknine, J., Potapov, I., Worrell, J. (eds.) RP 2014. LNCS, vol. 8762, pp. 112\u2013124. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11439-2_9"},{"key":"7_CR15","unstructured":"Halfon, S.: On Effective Representations of Well Quasi-Orderings. (Repr\u00e9sentations Effectives des Beaux Pr\u00e9-Ordres). Ph.D. thesis, University of Paris-Saclay, France (2018). https:\/\/tel.archives-ouvertes.fr\/tel-01945232"},{"issue":"5\u20136","key":"7_CR16","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0020-0190(99)00149-0","volume":"72","author":"P Jancar","year":"1999","unstructured":"Jancar, P.: A note on well quasi-orderings for powersets. Inf. Process. Lett. 72(5\u20136), 155\u2013160 (1999). https:\/\/doi.org\/10.1016\/S0020-0190(99)00149-0","journal-title":"Inf. Process. Lett."},{"key":"7_CR17","doi-asserted-by":"publisher","unstructured":"Jancar, P., Leroux, J.: Semilinear home-space is decidable for petri nets. CoRR abs\/2207.02697 (2022). https:\/\/doi.org\/10.48550\/arXiv.2207.02697","DOI":"10.48550\/arXiv.2207.02697"},{"key":"7_CR18","unstructured":"Lazic, R., Newcomb, T.C., Ouaknine, J., Roscoe, A.W., Worrell, J.: Nets with tokens which carry data. Fundam. Informaticae 88(3), 251\u2013274 (2008). http:\/\/content.iospress.com\/articles\/fundamenta-informaticae\/fi88-3-03"},{"key":"7_CR19","unstructured":"Mayr, R.: Lossy counter machines. Technical report TUM-I9827, Institut f\u00fcr Informatik (1998)"},{"key":"7_CR20","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/BFb0046843","volume-title":"Petri Nets: Central Models and Their Properties","author":"G Memmi","year":"1986","unstructured":"Memmi, G., Vautherin, J.: Analysing nets by the invariant method. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) ACPN 1986. LNCS, vol. 254, pp. 300\u2013336. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/BFb0046843"},{"key":"7_CR21","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-031-09843-7_3","volume-title":"Graph Transformation","author":"O \u00d6zkan","year":"2022","unstructured":"\u00d6zkan, O.: Decidability of resilience for well-structured graph transformation systems. In: Behr, N., Str\u00fcber, D. (eds.) ICGT 2022. LNCS, vol. 13349, pp. 38\u201357. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-09843-7_3"},{"key":"7_CR22","doi-asserted-by":"publisher","unstructured":"\u00d6zkan, O., W\u00fcrdemann, N.: Resilience of well-structured graph transformation systems. In: Hoffmann, B., Minas, M. (eds.) Proceedings Twelfth International Workshop on Graph Computational Models, GCM@STAF 2021, Online, 22nd June 2021. EPTCS, vol. 350, pp. 69\u201388 (2021). https:\/\/doi.org\/10.4204\/EPTCS.350.5","DOI":"10.4204\/EPTCS.350.5"},{"key":"7_CR23","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.ssci.2017.10.005","volume":"102","author":"R Patriarca","year":"2018","unstructured":"Patriarca, R., Bergstr\u00f6m, J., Di Gravio, G., Costantino, F.: Resilience engineering: current status of the research and future challenges. Saf. Sci. 102, 79\u2013100 (2018). https:\/\/doi.org\/10.1016\/j.ssci.2017.10.005","journal-title":"Saf. Sci."},{"key":"7_CR24","volume-title":"Petri Net Theory and the Modeling of Systems","author":"JL Peterson","year":"1981","unstructured":"Peterson, J.L.: Petri Net Theory and the Modeling of Systems. Prentice Hall PTR, Hoboken (1981)"},{"key":"7_CR25","doi-asserted-by":"publisher","unstructured":"Prasad, S., Zuck, L.D.: Self-similarity breeds resilience. In: Gebler, D., Peters, K. (eds.) Proceedings Combined 23rd International Workshop on Expressiveness in Concurrency and 13th Workshop on Structural Operational Semantics, EXPRESS\/SOS 2016, Qu\u00e9bec City, Canada, 22nd August 2016. EPTCS, vol. 222, pp. 30\u201344 (2016). https:\/\/doi.org\/10.4204\/EPTCS.222.3","DOI":"10.4204\/EPTCS.222.3"},{"issue":"1","key":"7_CR26","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/2893582.2893585","volume":"3","author":"S Schmitz","year":"2016","unstructured":"Schmitz, S.: The complexity of reachability in vector addition systems. ACM SIGLOG News 3(1), 4\u201321 (2016). https:\/\/doi.org\/10.1145\/2893582.2893585","journal-title":"ACM SIGLOG News"},{"key":"7_CR27","unstructured":"Schmitz, S., Schnoebelen, P.: Algorithmic Aspects of WQO Theory (2012). https:\/\/cel.hal.science\/cel-00727025"},{"key":"7_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-15349-5_4","volume-title":"Reachability Problems","author":"P Schnoebelen","year":"2010","unstructured":"Schnoebelen, P.: Lossy counter machines decidability cheat sheet. In: Ku\u010dera, A., Potapov, I. (eds.) RP 2010. LNCS, vol. 6227, pp. 51\u201375. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15349-5_4"},{"key":"7_CR29","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/BF00289715","volume":"21","author":"R Valk","year":"1985","unstructured":"Valk, R., Jantzen, M.: The residue of vector sets with applications to decidability problems in petri nets. Acta Informatica 21, 643\u2013674 (1985). https:\/\/doi.org\/10.1007\/BF00289715","journal-title":"Acta Informatica"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-50524-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,3]],"date-time":"2024-01-03T00:11:21Z","timestamp":1704240681000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-50524-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,30]]},"ISBN":["9783031505232","9783031505249"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-50524-9_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,30]]},"assertion":[{"value":"30 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"VMCAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Verification, Model Checking, and Abstract Interpretation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 January 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 January 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"vmcai2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/popl24.sigplan.org\/home\/VMCAI-2024","order":11,"name":"conference_url","label":"Conference URL","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":"74","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":"30","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":"0","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":"41% - 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":"6","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)"}}]}}