{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:20:36Z","timestamp":1742912436314,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319223599"},{"type":"electronic","value":"9783319223605"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-22360-5_1","type":"book-chapter","created":{"date-parts":[[2015,7,27]],"date-time":"2015-07-27T08:24:42Z","timestamp":1437985482000},"page":"3-12","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Automata and Logics for Concurrent Systems: Five Models in Five Pages"],"prefix":"10.1007","author":[{"given":"Benedikt","family":"Bollig","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,28]]},"reference":[{"key":"1_CR1","unstructured":"Aiswarya, C., Gastin, P.: Reasoning about distributed systems: WYSIWYG. In: FSTTCS 2014, Leibniz International Proceedings in Informatics, vol. 29, pp. 11\u201330. Leibniz-Zentrum f\u00fcr Informatik (2014)"},{"issue":"3","key":"1_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1516512.1516518","volume":"56","author":"R Alur","year":"2009","unstructured":"Alur, R., Madhusudan, P.: Adding nesting structure to words. J. ACM 56(3), 1\u201343 (2009)","journal-title":"J. ACM"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-540-85780-8_9","volume-title":"Developments in Language Theory","author":"MF Atig","year":"2008","unstructured":"Atig, M.F., Bollig, B., Habermehl, P.: Emptiness of multi-pushdown automata Is 2ETIME-complete. In: Ito, M., Toyama, M. (eds.) DLT 2008. LNCS, vol. 5257, pp. 121\u2013133. Springer, Heidelberg (2008)"},{"issue":"4\u20135","key":"1_CR4","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":"1_CR5","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/1970398.1970403","volume":"12","author":"M Bojanczyk","year":"2011","unstructured":"Bojanczyk, 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":"1_CR6","doi-asserted-by":"crossref","unstructured":"Bollig, B.: On the expressive power of $$2$$-stack visibly pushdown automata. Logical Methods in Computer Science 4(4:16), 1\u201335 (2008)","DOI":"10.2168\/LMCS-4(4:16)2008"},{"issue":"2\u20133","key":"1_CR7","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.tcs.2006.01.014","volume":"358","author":"B Bollig","year":"2006","unstructured":"Bollig, B., Leucker, M.: Message-passing automata are expressively equivalent to EMSO logic. Theor. Comput. Sci. 358(2\u20133), 150\u2013172 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"1_CR8","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1145\/322374.322380","volume":"30","author":"D Brand","year":"1983","unstructured":"Brand, D., Zafiropulo, P.: On communicating finite-state machines. J. ACM 30(2), 323\u2013342 (1983)","journal-title":"J. ACM"},{"key":"1_CR9","first-page":"62","volume":"5","author":"J B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, J.: Weak second order logic and finite automata. Z. Math. Logik, Grundlag. Math. 5, 62\u201366 (1960)","journal-title":"Z. Math. Logik, Grundlag. Math."},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/978-3-642-32940-1_38","volume-title":"CONCUR 2012 \u2013 Concurrency Theory","author":"A Cyriac","year":"2012","unstructured":"Cyriac, A., Gastin, P., Naryanan Kumar, K.: MSO decidability of multi-pushdown systems via split-width. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol. 7454, pp. 547\u2013561. Springer, Heidelberg (2012)"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1090\/S0002-9947-1961-0139530-9","volume":"98","author":"CC Elgot","year":"1961","unstructured":"Elgot, C.C.: Decision problems of finite automata design and related arithmetics. Trans. Am. Math. Soci. 98, 21\u201352 (1961)","journal-title":"Trans. Am. Math. Soci."},{"issue":"6","key":"1_CR12","doi-asserted-by":"publisher","first-page":"920","DOI":"10.1016\/j.ic.2006.01.005","volume":"204","author":"B Genest","year":"2006","unstructured":"Genest, B., Kuske, D., Muscholl, A.: A Kleene theorem and model checking algorithms for existentially bounded communicating automata. Infor. Comput. 204(6), 920\u2013956 (2006)","journal-title":"Infor. Comput."},{"issue":"1","key":"1_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2004.08.004","volume":"202","author":"JG Henriksen","year":"2005","unstructured":"Henriksen, J.G., Mukund, M., Narayan, K., Sohoni, M., Thiagarajan, P.S.: A theory of regular MSC languages. Infor. Comput. 202(1), 1\u201338 (2005)","journal-title":"Infor. Comput."},{"key":"1_CR14","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":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-642-12200-2_10","volume-title":"LATIN 2010: Theoretical Informatics","author":"S La Torre","year":"2010","unstructured":"La Torre, S., Madhusudan, P., Parlato, G.: The language theory of bounded context-switching. In: L\u00f3pez-Ortiz, A. (ed.) LATIN 2010. LNCS, vol. 6034, pp. 96\u2013107. Springer, Heidelberg (2010)"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1007\/978-3-319-09698-8_11","volume-title":"Developments in Language Theory","author":"S La Torre","year":"2014","unstructured":"La Torre, S., Napoli, M., Parlato, G.: Scope-bounded pushdown languages. In: Shur, A.M., Volkov, M.V. (eds.) DLT 2014. LNCS, vol. 8633, pp. 116\u2013128. Springer, Heidelberg (2014)"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/978-3-662-44522-8_32","volume-title":"Mathematical Foundations of Computer Science 2014","author":"S La Torre","year":"2014","unstructured":"La Torre, S., Napoli, M., Parlato, G.: A unifying approach for multistack pushdown automata. In: Csuhaj-Varj\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014, Part I. LNCS, vol. 8634, pp. 377\u2013389. Springer, Heidelberg (2014)"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Madhusudan, P., Parlato, G.: The tree width of auxiliary storage. In: POPL 2011, pp. 283\u2013294. ACM (2011)","DOI":"10.1145\/1925844.1926419"},{"key":"1_CR19","unstructured":"Thomas, W.: On logical definability of trace languages. In: Proceedings of Algebraic and Syntactic Methods in Computer Science (ASMICS), Report TUM-I9002, Technical University of Munich, pp. 172\u2013182 (1990)"},{"key":"1_CR20","unstructured":"Thomas, W.: Elements of an automata theory over partial orders. In: POMIV 1996, vol. 29, DIMACS. AMS (1996)"},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-642-59126-6_7","volume-title":"Handbook of Formal Languages","author":"W Thomas","year":"1997","unstructured":"Thomas, W.: Languages, automata and logic. In: Salomaa, A., Rozenberg, G. (eds.) Handbook of Formal Languages, vol. 3, pp. 389\u2013455. Springer, Heidelberg (1997)"},{"key":"1_CR22","unstructured":"Trakhtenbrot, B.A.: Finite automata and monadic second order logic. Siberian Math. J. 3, 103\u2013131 (1962); In Russian; English translation in Amer. Math. Soc. Transl. 59, 23\u201355 (1966)"},{"key":"1_CR23","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1051\/ita\/1987210200991","volume":"21","author":"W Zielonka","year":"1987","unstructured":"Zielonka, W.: Notes on finite asynchronous automata. R.A.I.R.O. Informatique Th\u00e9orique et Applications 21, 99\u2013135 (1987)","journal-title":"Informatique Th\u00e9orique et Applications"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-22360-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T10:51:57Z","timestamp":1676026317000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-22360-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319223599","9783319223605"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-22360-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"28 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}