{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:47:00Z","timestamp":1743130020483,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031086786"},{"type":"electronic","value":"9783031086793"}],"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-08679-3_4","type":"book-chapter","created":{"date-parts":[[2022,6,11]],"date-time":"2022-06-11T13:05:13Z","timestamp":1654952713000},"page":"50-66","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Branch-Well-Structured Transition Systems and\u00a0Extensions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0985-6115","authenticated-orcid":false,"given":"Benedikt","family":"Bollig","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0702-3232","authenticated-orcid":false,"given":"Alain","family":"Finkel","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6819-9093","authenticated-orcid":false,"given":"Amrita","family":"Suresh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,12]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","unstructured":"Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.: Algorithmic analysis of programs with well quasi-ordered domains. Inf. Comput. 160(1-2), 109\u2013127 (2000). https:\/\/doi.org\/10.1006\/inco.1999.2843","DOI":"10.1006\/inco.1999.2843"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-662-43951-7_2","volume-title":"Automata, Languages, and Programming","author":"M Blondin","year":"2014","unstructured":"Blondin, M., Finkel, A., McKenzie, P.: Handling infinitely branching WSTS. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8573, pp. 13\u201325. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43951-7_2"},{"key":"4_CR3","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":"4_CR4","doi-asserted-by":"publisher","unstructured":"Bollig, B., Finkel, A., Suresh, A.: Bounded reachability problems are decidable in FIFO machines. In: Konnov, I., Kov\u00e1cs, L. (eds.) 31st International Conference on Concurrency Theory, CONCUR 2020, September 1\u20134, 2020, Vienna, Austria (Virtual Conference). LIPIcs, vol. 171, pp. 49:1\u201349:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2020.49","DOI":"10.4230\/LIPIcs.CONCUR.2020.49"},{"key":"4_CR5","doi-asserted-by":"publisher","unstructured":"Chadha, R., Viswanathan, M.: Deciding branching time properties for asynchronous programs. Theor. Comput. Sci. 410(42), 4169\u20134179 (2009). https:\/\/doi.org\/10.1016\/j.tcs.2009.01.021","DOI":"10.1016\/j.tcs.2009.01.021"},{"issue":"4","key":"4_CR6","doi-asserted-by":"publisher","first-page":"413","DOI":"10.2307\/2370405","volume":"35","author":"LE Dickson","year":"1913","unstructured":"Dickson, L.E.: Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. Am. J. Math. 35(4), 413\u2013422 (1913)","journal-title":"Am. J. Math."},{"key":"4_CR7","doi-asserted-by":"publisher","unstructured":"D\u2019Osualdo, E., Stutz, F.: Decidable inductive invariants for verification of cryptographic protocols with unbounded sessions. In: Konnov, I., Kov\u00e1cs, L. (eds.) 31st International Conference on Concurrency Theory, CONCUR 2020, September 1\u20134, 2020, Vienna, Austria (Virtual Conference). LIPIcs, vol. 171, pp. 31:1\u201331:23. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2020.31","DOI":"10.4230\/LIPIcs.CONCUR.2020.31"},{"key":"4_CR8","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"},{"issue":"5","key":"4_CR9","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1090\/S0002-9904-1956-10036-0","volume":"62","author":"P Erd\u0151s","year":"1956","unstructured":"Erd\u0151s, P., Rado, R.: A partition calculus in set theory. Bull. Amer. Math. Soc. 62(5), 427\u2013489 (1956)","journal-title":"Bull. Amer. Math. Soc."},{"issue":"2","key":"4_CR10","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":"4_CR11","doi-asserted-by":"publisher","unstructured":"Finkel, A., McKenzie, P., Picaronny, C.: A well-structured framework for analysing petri net extensions. Inf. Comput. 195(1-2), 1\u201329 (2004). https:\/\/doi.org\/10.1016\/j.ic.2004.01.005, http:\/\/www.lsv.ens-cachan.fr\/Publis\/PAPERS\/PS\/FMP-wstsPN-icomp.ps","DOI":"10.1016\/j.ic.2004.01.005"},{"key":"4_CR12","unstructured":"Finkel, A., Praveen, M.: Verification of flat fifo systems. In: Fokkink, W., van Glabbeek, R. (eds.) Proceedings of the 30th International Conference on Concurrency Theory (CONCUR 2019), Leibniz International Proceedings in Informatics, Leibniz-Zentrum f\u00fcr Informatik, Amsterdam, The Netherlands, August 2019"},{"issue":"1\u20132","key":"4_CR13","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":"4_CR14","doi-asserted-by":"crossref","unstructured":"Higman, G.: Ordering by divisibility in abstract algebras. In: Proceedings of The London Mathematical Society, pp. 326\u2013336 (1952)","DOI":"10.1112\/plms\/s3-2.1.326"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0304-3975(93)90212-C","volume":"113","author":"T J\u00e9ron","year":"1993","unstructured":"J\u00e9ron, T., Jard, C.: Testing for unboundedness of fifo channels. Theor. Comput. Sci. 113, 93\u2013117 (1993)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Distributed Objects, Components, and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08679-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,11]],"date-time":"2022-06-11T13:05:38Z","timestamp":1654952738000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08679-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031086786","9783031086793"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08679-3_4","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":"12 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FORTE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Techniques for Distributed Objects, Components, and Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lucca","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"13 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"forte2022","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":"28","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":"11","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":"39% - 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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}