{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T10:01:15Z","timestamp":1766138475039,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031453281"},{"type":"electronic","value":"9783031453298"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-45329-8_4","type":"book-chapter","created":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T18:02:40Z","timestamp":1697911360000},"page":"74-94","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the\u00a0Containment Problem for\u00a0Deterministic Multicounter Machine Models"],"prefix":"10.1007","author":[{"given":"Oscar H.","family":"Ibarra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ian","family":"McQuillan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,22]]},"reference":[{"issue":"3","key":"4_CR1","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/S0022-0000(74)80027-9","volume":"8","author":"BS Baker","year":"1974","unstructured":"Baker, B.S., Book, R.V.: Reversal-bounded multipushdown machines. J. Comput. Syst. Sci. 8(3), 315\u2013332 (1974)","journal-title":"J. Comput. Syst. Sci."},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Baumann, P., et al.: Unboundedness problems for machines with reversal-bounded counters. In: 25th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS) (2023)","DOI":"10.1007\/978-3-031-30829-1_12"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.tcs.2020.10.006","volume":"862","author":"A Carpi","year":"2021","unstructured":"Carpi, A., D\u2019Alessandro, F., Ibarra, O.H., McQuillan, I.: Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity. Theoret. Comput. Sci. 862, 97\u2013118 (2021)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Crespi-Reghizzi, S., Pietro, P.S.: Deterministic counter machines and parallel matching computations. In: Proceedings of the 18th International Conference on Implementation and Application of Automata, CIAA 2013, vol. 7982, pp. 280\u2013291 (2013)","DOI":"10.1007\/978-3-642-39274-0_25"},{"key":"4_CR5","unstructured":"Czerwi\u0144ski, W., Hofman, P.: Language inclusion for boundedly-ambiguous vector addition systems is decidable. In: Klin, B., Lasota, S., Muscholl, A. (eds.) Proceedings of the 33rd International Conference on Concurrency Theory (CONCUR 2022), pp. 16:1\u201316:22 (2022)"},{"key":"4_CR6","unstructured":"Czerwinski, W., Hofman, P., Zetzsche, G.: Unboundedness problems for languages of vector addition systems. In: Chatzigiannakis, I., Kaklamanis, C., Marx, D., Sannella, D. (eds.) 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), vol. 107, p. 119. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2018)"},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/j.jcss.2018.02.003","volume":"104","author":"J Eremondi","year":"2019","unstructured":"Eremondi, J., Ibarra, O.H., McQuillan, I.: Insertion operations on deterministic reversal-bounded counter machines. J. Comput. Syst. Sci. 104, 244\u2013257 (2019)","journal-title":"J. Comput. Syst. Sci."},{"key":"4_CR8","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-0-387-34892-6_1","volume-title":"Protocol Specification, Testing and Verification XV","author":"R Gerth","year":"1996","unstructured":"Gerth, R., Peled, D., Vardi, M.Y., Wolper, P.: Simple on-the-fly automatic verification of linear temporal logic. In: PSTV 1995. IAICT, pp. 3\u201318. Springer, Boston, MA (1996). https:\/\/doi.org\/10.1007\/978-0-387-34892-6_1"},{"key":"4_CR9","volume-title":"The Mathematical Theory of Context-Free Languages","author":"S Ginsburg","year":"1966","unstructured":"Ginsburg, S.: The Mathematical Theory of Context-Free Languages. McGraw-Hill Inc, New York (1966)"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-3975(78)90020-8","volume":"7","author":"S Greibach","year":"1978","unstructured":"Greibach, S.: Remarks on blind and partially blind one-way multicounter machines. Theoret. Comput. Sci. 7, 311\u2013324 (1978)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR11","volume-title":"The SPIN Model Checker: Primer and Reference Manual","author":"GJ Holzmann","year":"2003","unstructured":"Holzmann, G.J.: The SPIN Model Checker: Primer and Reference Manual. Addison-Wesley, Boston (2003)"},{"key":"4_CR12","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, MA (1979)"},{"issue":"2","key":"4_CR13","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0304-3975(79)90041-0","volume":"8","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Pansiot, J.J.: On the reachability problem for 5-dimensional vector addition systems. Theoret. Comput. Sci. 8(2), 135\u2013159 (1979)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.tcs.2016.02.034","volume":"627","author":"O Ibarra","year":"2016","unstructured":"Ibarra, O., McQuillan, I.: The effect of end-markers on counter machines and commutativity. Theoret. Comput. Sci. 627, 71\u201381 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.tcs.2011.12.034","volume":"429","author":"O Ibarra","year":"2012","unstructured":"Ibarra, O., Yen, H.: On the containment and equivalence problems for two-way transducers. Theoret. Comput. Sci. 429, 155\u2013163 (2012)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"4_CR16","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0020-0190(74)90043-X","volume":"3","author":"OH Ibarra","year":"1974","unstructured":"Ibarra, O.H.: A note on semilinear sets and bounded-reversal multihead pushdown automata. Inf. Process. Lett. 3(1), 25\u201328 (1974)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"4_CR17","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/322047.322058","volume":"25","author":"OH Ibarra","year":"1978","unstructured":"Ibarra, O.H.: Reversal-bounded multicounter machines and their decision problems. J. ACM 25(1), 116\u2013133 (1978)","journal-title":"J. ACM"},{"issue":"1","key":"4_CR18","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1137\/S0097539792240625","volume":"23","author":"OH Ibarra","year":"1995","unstructured":"Ibarra, O.H., Jiang, T., Tran, N., Wang, H.: New decidability results concerning two-way counter machines. SIAM J. Comput. 23(1), 123\u2013137 (1995)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"4_CR19","doi-asserted-by":"publisher","first-page":"1291","DOI":"10.1142\/S0129054112400539","volume":"23","author":"OH Ibarra","year":"2012","unstructured":"Ibarra, O.H., Seki, S.: Characterizations of bounded semilinear languages by one-way and two-way deterministic machines. Int. J. Found. Comput. Sci. 23(6), 1291\u20131306 (2012)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Kosaraju, S.R.: Decidability of reachability in vector addition systems. In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, STOC 1982, pp. 267\u2013281 (1982)","DOI":"10.1145\/800070.802201"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Leroux, J.: Presburger vector addition systems. In: Proceedings of the 28th Annual ACM\/IEEE Symposium on Logic in Computer Science, pp. 23\u201332 (2013)","DOI":"10.1109\/LICS.2013.7"},{"issue":"3","key":"4_CR22","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1137\/0213029","volume":"13","author":"EW Mayr","year":"1984","unstructured":"Mayr, E.W.: An algorithm for the general Petri net reachability problem. SIAM J. Comput. 13(3), 441\u2013460 (1984)","journal-title":"SIAM J. Comput."},{"key":"4_CR23","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1007\/s00224-020-09997-2","volume":"65","author":"A Mottet","year":"2021","unstructured":"Mottet, A., Quaas, K.: The containment problem for unambiguous register automata and unambiguous timed automata. Theory Comput. Syst. 65, 706\u2013735 (2021)","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"4_CR24","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"R Parikh","year":"1966","unstructured":"Parikh, R.: On context-free languages. J. ACM 13(4), 570\u2013581 (1966)","journal-title":"J. ACM"},{"key":"4_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/BFb0039620","volume-title":"STACS 87","author":"E Pelz","year":"1987","unstructured":"Pelz, E.: Closure properties of deterministic Petri nets. In: Brandenburg, F.J., Vidal-Naquet, G., Wirsing, M. (eds.) STACS 1987. LNCS, vol. 247, pp. 371\u2013382. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/BFb0039620"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Rosenberg, A.L.: On multi-head finite automata. In: 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965), pp. 221\u2013228 (1965)","DOI":"10.1109\/FOCS.1965.19"},{"key":"4_CR27","unstructured":"Tang, N.V.: Pushdown Automata and Inclusion Problems. Ph.D. thesis, Japan Advanced Institute of Science and Technology, Japan (2007)"},{"key":"4_CR28","unstructured":"Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: Chatterjee, K., Sgall, J. (eds.) Proceedings of the 1st IEEE Symposium Logic in Computer Science (LICS 1986), pp. 332\u2013344. IEEE Computer Society (1986)"},{"key":"4_CR29","series-title":"Informatik-Fachberichte","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-642-68353-4_34","volume-title":"Application and Theory of Petri Nets","author":"G Vidal-Naquet","year":"1981","unstructured":"Vidal-Naquet, G.: Deterministic languages of Petri nets. In: Girault, C., Reisig, W. (eds.) Application and Theory of Petri Nets. Informatik-Fachberichte, vol. 52, pp. 198\u2013202. Springer, Berlin (1981). https:\/\/doi.org\/10.1007\/978-3-642-68353-4_34"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-45329-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T18:02:47Z","timestamp":1697911367000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-45329-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031453281","9783031453298"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-45329-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ATVA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Automated Technology for Verification and Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"atva2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/atva-conference.org\/2023\/","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":"115","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":"26% - 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.05","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":"9","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)"}},{"value":"7 tool papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}