{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T12:16:12Z","timestamp":1763727372858,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030010898"},{"type":"electronic","value":"9783030010904"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-01090-4_22","type":"book-chapter","created":{"date-parts":[[2018,9,29]],"date-time":"2018-09-29T11:23:23Z","timestamp":1538220203000},"page":"370-386","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Round-Bounded Control of Parameterized Systems"],"prefix":"10.1007","author":[{"given":"Benedikt","family":"Bollig","sequence":"first","affiliation":[]},{"given":"Mathieu","family":"Lehaut","sequence":"additional","affiliation":[]},{"given":"Nathalie","family":"Sznajder","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,30]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-45220-1_1","volume-title":"Computer Science Logic","author":"Parosh Aziz Abdulla","year":"2003","unstructured":"Abdulla, P.A., Bouajjani, A., d\u2019Orso, J.: Deciding monotonic games. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol. 2803, pp. 1\u201314. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45220-1_1"},{"issue":"5","key":"22_CR2","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/s10009-016-0424-3","volume":"18","author":"PA Abdulla","year":"2016","unstructured":"Abdulla, P.A., Delzanno, G.: Parameterized verification. Int. J. Softw. Tools Technol. Transf. 18(5), 469\u2013473 (2016)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/978-3-642-40184-8_9","volume-title":"CONCUR 2013 \u2013 Concurrency Theory","author":"PA Abdulla","year":"2013","unstructured":"Abdulla, P.A., Mayr, R., Sangnier, A., Sproston, J.: Solving parity games on integer vectors. In: D\u2019Argenio, P.R., Melgratti, H. (eds.) CONCUR 2013. LNCS, vol. 8052, pp. 106\u2013120. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40184-8_9"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-642-54013-4_15","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"B Aminof","year":"2014","unstructured":"Aminof, B., Jacobs, S., Khalimov, A., Rubin, S.: Parameterized model checking of token-passing systems. In: McMillan, K.L., Rival, X. (eds.) VMCAI 2014. LNCS, vol. 8318, pp. 262\u2013281. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54013-4_15"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-319-59647-1_21","volume-title":"Networked Systems","author":"MF Atig","year":"2017","unstructured":"Atig, M.F., Bouajjani, A., Narayan Kumar, K., Saivasan, P.: Parity games on bounded phase multi-pushdown systems. In: El Abbadi, A., Garbinato, B. (eds.) NETYS 2017. LNCS, vol. 10299, pp. 272\u2013287. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59647-1_21"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Atig, M.F., Bouajjani, A., Qadeer, S.: Context-bounded analysis for concurrent programs with dynamic creation of threads. Log. Methods Comput. Sci. 7(4) (2011)","DOI":"10.2168\/LMCS-7(4:4)2011"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-642-32940-1_5","volume-title":"CONCUR 2012 \u2013 Concurrency Theory","author":"B B\u00e9rard","year":"2012","unstructured":"B\u00e9rard, B., Haddad, S., Sassolas, M., Sznajder, N.: Concurrent games on VASS with inhibition. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol. 7454, pp. 39\u201352. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32940-1_5"},{"issue":"4\u20135","key":"22_CR8","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1016\/j.tcs.2009.10.009","volume":"411","author":"H Bj\u00f6rklund","year":"2010","unstructured":"Bj\u00f6rklund, H., Schwentick, T.: On notions of regularity for data languages. Theor. Comput. Sci. 411(4\u20135), 702\u2013715 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"22_CR9","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/1970398.1970403","volume":"12","author":"M Boja\u0144czyk","year":"2011","unstructured":"Boja\u0144czyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data words. ACM Trans. Comput. Log. 12(4), 27 (2011)","journal-title":"ACM Trans. Comput. Log."},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/978-3-642-14162-1_40","volume-title":"Automata, Languages and Programming","author":"T Br\u00e1zdil","year":"2010","unstructured":"Br\u00e1zdil, T., Jan\u010dar, P., Ku\u010dera, A.: Reachability games on extended vector addition systems with states. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 478\u2013489. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14162-1_40"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"13","DOI":"10.4204\/EPTCS.220.2","volume":"220","author":"Benedikt Br\u00fctsch","year":"2016","unstructured":"Br\u00fctsch, B., Thomas, W.: Playing games in the Baire space. In: Proceedings Cassting Workshop on Games for the Synthesis of Complex Systems and 3rd International Workshop on Synthesis of Complex Parameters, Volume 220 of EPTCS, pp. 13\u201325 (2016)","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-662-44522-8_19","volume-title":"Mathematical Foundations of Computer Science 2014","author":"J-B Courtois","year":"2014","unstructured":"Courtois, J.-B., Schmitz, S.: Alternating vector addition systems with states. In: Csuhaj-Varj\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014. LNCS, vol. 8634, pp. 220\u2013231. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44522-8_19"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Emerson, E.A., Jutla, C.S.: Tree automata, mu-calculus and determinacy. In: Proceedings of FOCS 1991, pp. 368\u2013377. IEEE Computer Society (1991)","DOI":"10.1109\/SFCS.1991.185392"},{"issue":"4","key":"22_CR14","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1142\/S0129054103001881","volume":"14","author":"EA Emerson","year":"2003","unstructured":"Emerson, E.A., Namjoshi, K.S.: On reasoning about rings. Int. J. Found. Comput. Sci. 14(4), 527\u2013550 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"22_CR15","unstructured":"Esparza, J.: Keeping a crowd safe: on the complexity of parameterized verification. In: STACS 2014, Volume 25 of Leibniz International Proceedings in Informatics, pp. 1\u201310. Leibniz-Zentrum f\u00fcr Informatik (2014)"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Figueira, D., Praveen, M.: Playing with repetitions in data words using energy games. In: Proceedings of LICS 2018, pp. 404\u2013413. ACM (2018)","DOI":"10.1145\/3209108.3209154"},{"key":"22_CR17","unstructured":"Hopcroft, J.E., Motwani, R., Rotwani, Ullman, J.D.: Introduction to Automata Theory, Languages and Computability, 2nd edn. Addison-Wesley Longman Publishing Company Inc., (2000)"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Jacobs, S., Bloem, R.: Parameterized synthesis. Log. Methods Comput. Sci. 10(1) (2014)","DOI":"10.2168\/LMCS-10(1:12)2014"},{"key":"22_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-319-24537-9_6","volume-title":"Reachability Problems","author":"P Jan\u010dar","year":"2015","unstructured":"Jan\u010dar, P.: On reachability-related games on vector addition systems with states. In: Boja\u0144czyk, M., Lasota, S., Potapov, I. (eds.) RP 2015. LNCS, vol. 9328, pp. 50\u201362. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24537-9_6"},{"key":"22_CR20","unstructured":"Kara, A.: Logics on data words: expressivity, satisfiability, model checking. Ph.D. thesis, Technical University of Dortmund (2016)"},{"key":"22_CR21","doi-asserted-by":"crossref","unstructured":"Kozen, D.: Lower bounds for natural proof systems. In: Proceedings of SFCS 1977, pp. 254\u2013266. IEEE Computer Society (1977)","DOI":"10.1109\/SFCS.1977.16"},{"key":"22_CR22","doi-asserted-by":"crossref","unstructured":"La Torre, S., Madhusudan, P., Parlato, G.: A robust class of context-sensitive languages. In: LICS 2007, pp. 161\u2013170. IEEE Computer Society Press (2007)","DOI":"10.1109\/LICS.2007.9"},{"key":"22_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-540-78800-3_21","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S Torre La","year":"2008","unstructured":"La Torre, S., Madhusudan, P., Parlato, G.: Context-bounded analysis of concurrent queue systems. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 299\u2013314. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_21"},{"key":"22_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/978-3-642-14295-6_54","volume-title":"Computer Aided Verification","author":"S La Torre","year":"2010","unstructured":"La Torre, S., Madhusudan, P., Parlato, G.: Model-checking parameterized concurrent programs using linear interfaces. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 629\u2013644. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14295-6_54"},{"key":"22_CR25","unstructured":"La Torre, S., Madhusudan, P., Parlato, G.: Model-checking parameterized concurrent programs using linear interfaces. Technical Report 2142\/15410, University of Illinois (2010). Available at http:\/\/hdl.handle.net\/2142\/15410"},{"issue":"4","key":"22_CR26","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1093\/logcom\/12.4.623","volume":"12","author":"M Lange","year":"2002","unstructured":"Lange, M., Stirling, C.: Model checking games for branching time logics. J. Log. Comput. 12(4), 623\u2013639 (2002)","journal-title":"J. Log. Comput."},{"key":"22_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-540-31980-1_7","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S Qadeer","year":"2005","unstructured":"Qadeer, S., Rehof, J.: Context-bounded model checking of concurrent software. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 93\u2013107. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31980-1_7"},{"issue":"2","key":"22_CR28","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1145\/349214.349241","volume":"22","author":"G Ramalingam","year":"2000","unstructured":"Ramalingam, G.: Context-sensitive synchronization-sensitive analysis is undecidable. ACM Trans. Program. Lang. Syst. 22(2), 416\u2013430 (2000)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"22_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-540-92687-0_27","volume-title":"Logical Foundations of Computer Science","author":"A Seth","year":"2008","unstructured":"Seth, A.: Games on multi-stack pushdown systems. In: Artemov, S., Nerode, A. (eds.) LFCS 2009. LNCS, vol. 5407, pp. 395\u2013408. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-92687-0_27"},{"key":"22_CR30","unstructured":"Stockmeyer, L.J.: The Complexity of Decision Problems in Automata Theory and Logic. Ph.D. thesis, MIT (1974)"},{"key":"22_CR31","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-642-59126-6_7","volume-title":"Handbook of Formal Languages","author":"Wolfgang Thomas","year":"1997","unstructured":"Thomas, Wolfgang: Languages, automata, and logic. In: Rozenberg, Grzegorz, Salomaa, Arto (eds.) Handbook of Formal Languages, pp. 389\u2013455. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-642-59126-6_7"},{"issue":"2","key":"22_CR32","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.2000.2894","volume":"164","author":"I Walukiewicz","year":"2001","unstructured":"Walukiewicz, I.: Pushdown processes: games and model-checking. Inf. Comput. 164(2), 234\u2013263 (2001)","journal-title":"Inf. Comput."},{"issue":"1\u20132","key":"22_CR33","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(98)00009-7","volume":"200","author":"W Zielonka","year":"1998","unstructured":"Zielonka, W.: Infinite games on finitely coloured graphs with applications to automata on infinite trees. TCS 200(1\u20132), 135\u2013183 (1998)","journal-title":"TCS"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-01090-4_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T14:50:59Z","timestamp":1761058259000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-01090-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030010898","9783030010904"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-01090-4_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"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":"Los Angeles, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"atva2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/atva-conference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}