{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T23:52:00Z","timestamp":1774396320669,"version":"3.50.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032206831","type":"print"},{"value":"9783032206848","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-20684-8_2","type":"book-chapter","created":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T14:08:05Z","timestamp":1773670085000},"page":"8-28","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Queue Automaton Revisited"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0287-0555","authenticated-orcid":false,"given":"Jos C. M.","family":"Baeten","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6710-8436","authenticated-orcid":false,"given":"Bas","family":"Luttik","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,3,17]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Baeten, J.C.M., Basten, T., Reniers, M.: Process Algebra: Equational Theories of Communicating Processes, vol.\u00a050. Cambridge University Press (2010)","DOI":"10.1017\/CBO9781139195003"},{"key":"2_CR2","first-page":"127","volume":"9","author":"JCM Baeten","year":"1986","unstructured":"Baeten, J.C.M., Bergstra, J.A., Klop, J.W.: Syntax and defining equations for an interrupt mechanism in process algebra. Fund. Inform. 9, 127\u2013168 (1986)","journal-title":"Fund. Inform."},{"issue":"1\u20132","key":"2_CR3","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0304-3975(87)90052-1","volume":"51","author":"JCM Baeten","year":"1987","unstructured":"Baeten, J.C.M., Bergstra, J.A., Klop, J.W.: On the consistency of Koomen\u2019s fair abstraction rule. Theoret. Comput. Sci. 51(1\u20132), 129\u2013176 (1987)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"15:1","DOI":"10.46298\/LMCS-19(1:15)2023","volume":"19","author":"JCM Baeten","year":"2023","unstructured":"Baeten, J.C.M., Carissimo, C., Luttik, B.: Pushdown automata and context-free grammars in bisimulation semantics. Logical Meth. Comput. Sci. 19, 15:1-15:32 (2023). https:\/\/doi.org\/10.46298\/LMCS-19(1:15)2023","journal-title":"Logical Meth. Comput. Sci."},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-540-85361-9_11","volume-title":"CONCUR 2008 - Concurrency Theory","author":"JCM Baeten","year":"2008","unstructured":"Baeten, J.C.M., Cuijpers, P.J.L., van Tilburg, P.J.A.: A context-free process as a pushdown automaton. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 98\u2013113. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85361-9_11"},{"key":"2_CR6","doi-asserted-by":"publisher","unstructured":"Baeten, J.C.M., Luttik, B.: Parallel pushdown automata and commutative context-free grammars in bisimulation semantics (extended abstract). In: Mezzina, C.A., Caltais, G. (eds.) Proceedings Combined 30th International Workshop on Expressiveness in Concurrency and 20th Workshop on Structural Operational Semantics, EXPRESS\/SOS 2023, Antwerp, Belgium, 18th September 2023. EPTCS, vol.\u00a0387, pp. 114\u2013131 (2023). https:\/\/doi.org\/10.4204\/EPTCS.387.9","DOI":"10.4204\/EPTCS.387.9"},{"key":"2_CR7","doi-asserted-by":"publisher","unstructured":"Baeten, J.C.M., Luttik, B.: Sequential value passing yields a Kleene theorem for processes. In: Capretta, V., Krebbers, R., Wiedijk, F. (eds.) Logics and Type Systems in Theory and Practice. LNCS, vol. 14560, pp. 1\u201316. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-61716-4_1","DOI":"10.1007\/978-3-031-61716-4_1"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.ic.2013.08.010","volume":"231","author":"JCM Baeten","year":"2013","unstructured":"Baeten, J.C.M., Luttik, B., van Tilburg, P.: Reactive Turing machines. Inf. Comput. 231, 143\u2013166 (2013). https:\/\/doi.org\/10.1016\/j.ic.2013.08.010. fundamentals of Computation Theory","journal-title":"Inf. Comput."},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0020-0190(96)00034-8","volume":"58","author":"T Basten","year":"1996","unstructured":"Basten, T.: Branching bisimulation is an equivalence indeed! Inf. Process. Lett. 58, 141\u2013147 (1996)","journal-title":"Inf. Process. Lett."},{"key":"2_CR10","doi-asserted-by":"publisher","unstructured":"Boudol, G.: Notes on algebraic calculi of processes. In: Apt, K.R. (ed.) Logics and Models of Concurrent Systems, pp. 261\u2013303. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/978-3-642-82453-1_9","DOI":"10.1007\/978-3-642-82453-1_9"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/3-540-57208-2_6","volume-title":"CONCUR\u201993","author":"RJ Glabbeek","year":"1993","unstructured":"Glabbeek, R.J.: The linear time \u2014 branching time spectrum II. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 66\u201381. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57208-2_6"},{"issue":"4","key":"2_CR12","doi-asserted-by":"publisher","first-page":"371","DOI":"10.3233\/FI-2009-109","volume":"93","author":"RJ van Glabbeek","year":"2009","unstructured":"van Glabbeek, R.J., Luttik, B., Tr\u010dka, N.: Branching bisimilarity with explicit divergence. Fund. Inform. 93(4), 371\u2013392 (2009). https:\/\/doi.org\/10.3233\/FI-2009-109","journal-title":"Fund. Inform."},{"issue":"2","key":"2_CR13","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(93)90006-F","volume":"113","author":"RJ van Glabbeek","year":"1993","unstructured":"van Glabbeek, R.J., Vaandrager, F.W.: Modular specification of process algebras. Theor. Comput. Sci. 113(2), 293\u2013348 (1993). https:\/\/doi.org\/10.1016\/0304-3975(93)90006-F","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"2_CR14","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/233551.233556","volume":"43","author":"RJ van Glabbeek","year":"1996","unstructured":"van Glabbeek, R.J., Weijland, P.: Branching time and abstraction in bisimulation semantics. J. ACM 43(3), 555\u2013600 (1996). https:\/\/doi.org\/10.1145\/233551.233556","journal-title":"J. ACM"},{"key":"2_CR15","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Pearson Education (2007)"},{"key":"2_CR16","series-title":"Emergence, Complexity and Computation","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-3-319-73216-9_19","volume-title":"Reversibility and Universality","author":"M Kutrib","year":"2018","unstructured":"Kutrib, M., Malcher, A., Wendlandt, M.: Queue automata: foundations and\u00a0developments. In: Adamatzky, A. (ed.) Reversibility and Universality. ECC, vol. 30, pp. 385\u2013431. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73216-9_19"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Luttik, B., Yang, F.: The $$\\pi $$-calculus is behaviourally complete and orbit-finitely executable. Log. Methods Comput. Sci. 17(1) (2021). https:\/\/lmcs.episciences.org\/7165","DOI":"10.23638\/LMCS-17(1:14)2021"},{"key":"2_CR18","unstructured":"Manna, Z.: Mathematical Theory of Computation. McGraw-Hill (1974)"},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-540-48654-1_4","volume-title":"CONCUR \u201994: Concurrency Theory","author":"S Mauw","year":"1994","unstructured":"Mauw, S., Mulder, H.: Regularity of BPA-systems is decidable. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol. 836, pp. 34\u201347. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/978-3-540-48654-1_4"},{"key":"2_CR20","volume-title":"Communication and Concurrency","author":"R Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall, Englewood Cliffs (1989)"},{"key":"2_CR21","doi-asserted-by":"publisher","first-page":"197","DOI":"10.2307\/2371809","volume":"65","author":"EL Post","year":"1943","unstructured":"Post, E.L.: Formal reductions of the classical combinatorial decision problem. Am. J. Math. 65, 197\u2013215 (1943)","journal-title":"Am. J. Math."},{"key":"2_CR22","unstructured":"Rogers, Jr., H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill (1967)"},{"key":"2_CR23","unstructured":"van Tilburg, P.: From Computability to Executability. Ph.D. thesis, Eindhoven University of Technology (2011)"},{"issue":"42","key":"2_CR24","first-page":"230","volume":"2","author":"AM Turing","year":"1936","unstructured":"Turing, A.M.: On computable numbers, with an application to the Entscheidungsproblem. Proc. Lond. Math. Soc. 2(42), 230\u2013265 (1936)","journal-title":"Proc. Lond. Math. Soc."},{"key":"2_CR25","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF02234250","volume":"5","author":"R Vollmar","year":"1970","unstructured":"Vollmar, R.: \u00dcber einen automaten mit pufferspeicherung. Computing 5, 57\u201370 (1970)","journal-title":"Computing"}],"container-title":["Lecture Notes in Computer Science","Juggling Formal Methods and Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-20684-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T23:03:06Z","timestamp":1774393386000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-20684-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032206831","9783032206848"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-20684-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"17 March 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}}]}}