{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:42:16Z","timestamp":1743079336088,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030625351"},{"type":"electronic","value":"9783030625368"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-62536-8_1","type":"book-chapter","created":{"date-parts":[[2020,11,7]],"date-time":"2020-11-07T02:02:50Z","timestamp":1604714570000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Mutually Accepting Capacitated Automata"],"prefix":"10.1007","author":[{"given":"Ravid","family":"Alon","sequence":"first","affiliation":[]},{"given":"Orna","family":"Kupferman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,11,6]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-61474-5_53","volume-title":"Computer Aided Verification","author":"B Boigelot","year":"1996","unstructured":"Boigelot, B., Godefroid, P.: Symbolic verification of communication protocols with infinite state spaces using QDDs. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, pp. 1\u201312. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61474-5_53"},{"issue":"2","key":"1_CR2","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10703-008-0048-7","volume":"32","author":"A Bouajjani","year":"2008","unstructured":"Bouajjani, A., Habermehl, P., Vojnar, T.: Verification of parametric concurrent systems with prioritised FIFO resource management. Formal Methods Syst. Des. 32(2), 129\u2013172 (2008)","journal-title":"Formal Methods Syst. Des."},{"key":"1_CR3","unstructured":"Cadilhac, M., Finkel, A., McKenzie, P.: On the expressiveness of Parikh automata and related models. In: 3rd Workshop on Non-Classical Models for Automata and Applications - NCMA, pp. 103\u2013119 (2011)"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/BFb0028751","volume-title":"Computer Aided Verification","author":"H Comon","year":"1998","unstructured":"Comon, H., Jurski, Y.: Multiple counters automata, safety analysis and presburger arithmetic. In: Hu, A.J., Vardi, M.Y. (eds.) CAV 1998. LNCS, vol. 1427, pp. 268\u2013279. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0028751"},{"key":"1_CR5","volume-title":"Flows in Networks","author":"L Ford","year":"1962","unstructured":"Ford, L., Fulkerson, D.: Flows in Networks. Princeton University Press, Princeton (1962)"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/3-540-45061-0_54","volume-title":"Automata, Languages and Programming","author":"F Klaedtke","year":"2003","unstructured":"Klaedtke, F., Rue\u00df, H.: Monadic second-order logics with cardinalities. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 681\u2013696. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45061-0_54"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Krishnan, S., Puri, A., Brayton, R.: Deterministic $$\\omega $$-automata vis-a-vis deterministic B\u00fcchi automata. In: Algorithms and Computations. Lecture Notes in Computer Science, vol. 834, pp. 378\u2013386. Springer (1994)","DOI":"10.1007\/3-540-58325-4_202"},{"issue":"4","key":"1_CR8","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1142\/S0129054106004157","volume":"17","author":"O Kupferman","year":"2006","unstructured":"Kupferman, O., Morgenstern, G., Murano, A.: Typeness for $$\\omega $$-regular automata. Int. J. Found. Comput. Sci. 17(4), 869\u2013884 (2006)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Kupferman, O., Sheinvald, S.: Capacitated automata and systems. Inf. Comput. 961, 269 (2019)","DOI":"10.1016\/j.ic.2019.104451"},{"key":"1_CR10","unstructured":"Kupferman, O., Tamir, T.: Properties and utilization of capacitated automata. In: Proceedings 34th Conference on Foundations of Software Technology and Theoretical Computer Science. LIPIcs, vol. 29, pp. 33\u201344. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany (2014)"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"L\u00f6ding, C.: Optimal bounds for the transformation of $$\\omega $$-automata. In: Proceedings 19th Conference on Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science, vol. 1738, pp. 97\u2013109 (1999)","DOI":"10.1007\/3-540-46691-6_8"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Qiu, R., Joshi, S.: Deterministic finite capacity automata: a solution to reduce the complexity of modeling and control of automated manufacturing systems. In: Proceedings Symposium on Computer-Aided Control System Design, pp. 218\u2013223 (1996)","DOI":"10.1109\/CACSD.1996.555285"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-62536-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,10]],"date-time":"2025-03-10T19:22:52Z","timestamp":1741634572000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-62536-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030625351","9783030625368"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-62536-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"6 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DCFS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Descriptional Complexity of Formal Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sofl2020.conf.tuwien.ac.at\/DCFS2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}