{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T18:12:24Z","timestamp":1781892744705,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540242970","type":"print"},{"value":"9783540305798","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30579-8_18","type":"book-chapter","created":{"date-parts":[[2010,12,20]],"date-time":"2010-12-20T11:45:34Z","timestamp":1292845534000},"page":"267-281","source":"Crossref","is-referenced-by-count":11,"title":["Weak Automata for the Linear Time \u03bc-Calculus"],"prefix":"10.1007","author":[{"given":"Martin","family":"Lange","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"18_CR1","first-page":"173","volume-title":"Proc. 13th Annual ACM Symp. on Principles of Programming Languages","author":"H. Barringer","year":"1986","unstructured":"Barringer, H., Kuiper, R., Pnueli, A.: A really abstract concurrent model and its temporal logic. In: Proc. 13th Annual ACM Symp. on Principles of Programming Languages, pp. 173\u2013183. ACM, New York (1986)"},{"key":"18_CR2","unstructured":"B\u00e9ki\u0107, H.: In: Bekic, H. (ed.) Programming Languages and their Definition. LNCS, vol.\u00a0177. Springer, Heidelberg (1984)"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-49059-0_14","volume-title":"Tools and Algorithms for the Construction of Analysis of Systems","author":"A. Biere","year":"1999","unstructured":"Biere, A., Cimatti, A., Clarke, E.M., Zhu, Y.: Symbolic model checking without BDDs. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol.\u00a01579, p. 193. Springer, Heidelberg (1999)"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/3-540-61604-7_58","volume-title":"CONCUR \u201996: Concurrency Theory","author":"J.C. Bradfield","year":"1996","unstructured":"Bradfield, J.C.: The modal \u03bc-calculus alternation hierarchy is strict. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.\u00a01119, pp. 233\u2013246. Springer, Heidelberg (1996)"},{"key":"18_CR5","first-page":"1","volume-title":"Proc. Congress on Logic, Method, and Philosophy of Science","author":"J.R. B\u00fcchi","year":"1962","unstructured":"B\u00fcchi, J.R.: On a decision method in restricted second order arithmetic. In: Proc. Congress on Logic, Method, and Philosophy of Science, pp. 1\u201312. Stanford University Press, Stanford (1962)"},{"issue":"1","key":"18_CR6","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A.K. Chandra","year":"1981","unstructured":"Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. Journal of the ACM\u00a028(1), 114\u2013133 (1981)","journal-title":"Journal of the ACM"},{"key":"18_CR7","first-page":"99","volume-title":"Proc. 12th Symp. on Logic in Computer Science, LICS 1997","author":"S. Dziembowski","year":"1997","unstructured":"Dziembowski, S., Jurdzi\u0144ski, M., Walukiewicz, I.: How much memory is needed to win infinite games? In: Proc. 12th Symp. on Logic in Computer Science, LICS 1997, Warsaw, Poland, pp. 99\u2013110. IEEE, Los Alamitos (1997)"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Emerson, E.A.: Model checking and the \u03bc-calculus. In: Immerman, N., Kolaitis, P.G. (eds.) Descriptive Complexity and Finite Models, ch. 6. DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a031, AMS (1997)","DOI":"10.1090\/dimacs\/031\/06"},{"key":"18_CR9","first-page":"368","volume-title":"Proc. 32nd Symp. on Foundations of Computer Science","author":"E.A. Emerson","year":"1991","unstructured":"Emerson, E.A., Jutla, C.S.: Tree automata, \u03bc-calculus and determinacy. In: Proc. 32nd Symp. on Foundations of Computer Science, San Juan, Puerto Rico, pp. 368\u2013377. IEEE, Los Alamitos (1991)"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/3-540-61604-7_60","volume-title":"CONCUR \u201996: Concurrency Theory","author":"D. Janin","year":"1996","unstructured":"Janin, D., Walukiewicz, I.: On the expressive completeness of the propositional \u03bc-calculus with respect to monadic second order logic. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.\u00a01119, pp. 263\u2013277. Springer, Heidelberg (1996)"},{"key":"18_CR11","unstructured":"Kaivola, R.: Using Automata to Characterise Fixed Point Temporal Logics. PhD thesis, LFCS, Division of Informatics, The University of Edinburgh, Tech. Rep. ECS-LFCS-97-356 (1997)"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D. Kozen","year":"1983","unstructured":"Kozen, D.: Results on the propositional \u03bc-calculus. TCS\u00a027, 333\u2013354 (1983)","journal-title":"TCS"},{"issue":"3","key":"18_CR13","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1145\/377978.377993","volume":"2","author":"O. Kupferman","year":"2001","unstructured":"Kupferman, O., Vardi, M.Y.: Weak alternating automata are not that weak. ACM Transactions on Computational Logic\u00a02(3), 408\u2013429 (2001)","journal-title":"ACM Transactions on Computational Logic"},{"issue":"2","key":"18_CR14","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1145\/333979.333987","volume":"47","author":"O. Kupferman","year":"2000","unstructured":"Kupferman, O., Vardi, M.Y., Wolper, P.: An automata-theoretic approach to branching-time model checking. Journal of the ACM\u00a047(2), 312\u2013360 (2000)","journal-title":"Journal of the ACM"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/3-540-44929-9_36","volume-title":"Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics","author":"C. L\u00f6ding","year":"2000","unstructured":"L\u00f6ding, C., Thomas, W.: Alternating automata and logics over infinite words. In: Watanabe, O., Hagiya, M., Ito, T., van Leeuwen, J., Mosses, P.D. (eds.) TCS 2000. LNCS, vol.\u00a01872, pp. 521\u2013535. Springer, Heidelberg (2000)"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","first-page":"100","volume-title":"Automata on Infinite Words","author":"D. Muller","year":"1985","unstructured":"Muller, D., Schupp, P.: Alternating automata on infinite objects: determinacy and rabin\u2019s theorem. In: Perrin, D., Nivat, M. (eds.) Automata on Infinite Words. LNCS, vol.\u00a0192, pp. 100\u2013107. Springer, Heidelberg (1985)"},{"key":"18_CR17","first-page":"422","volume-title":"Proc. 3rd Symp. on Logic in Computer Science, LICS 1988","author":"D.E. Muller","year":"1988","unstructured":"Muller, D.E., Saoudi, A., Schupp, P.E.: Weak alternating automata give a simple explanation of why most temporal and dynamic logics are decidable in exponential time. In: Proc. 3rd Symp. on Logic in Computer Science, LICS 1988, Edinburgh, Scotland, pp. 422\u2013427. IEEE, Los Alamitos (1988)"},{"key":"18_CR18","first-page":"1","volume":"141","author":"M.O. Rabin","year":"1969","unstructured":"Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Trans. of Amer. Math. Soc.\u00a0141, 1\u201335 (1969)","journal-title":"Trans. of Amer. Math. Soc."},{"key":"18_CR19","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"CONCUR \u201995 Concurrency Theory","author":"C. Stirling","year":"1995","unstructured":"Stirling, C.: Local model checking games. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 1\u201311. Springer, Heidelberg (1995)"},{"key":"18_CR20","first-page":"250","volume-title":"Proc. Conf. on Principles of Programming Languages, POPL 1988","author":"M.Y. Vardi","year":"1988","unstructured":"Vardi, M.Y.: A temporal fixpoint calculus. In: Proc. Conf. on Principles of Programming Languages, POPL 1988, pp. 250\u2013259. ACM Press, New York (1988)"},{"key":"18_CR21","series-title":"Lecture Notes in Computer Science","volume-title":"Logics for Concurrency","author":"M.Y. Vardi","year":"1996","unstructured":"Vardi, M.Y.: An Automata-Theoretic Approach to Linear Temporal Logic. In: Moller, F., Birtwistle, G. (eds.) Logics for Concurrency. LNCS, vol.\u00a01043. Springer, Heidelberg (1996)"},{"key":"18_CR22","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/LICS.1995.523240","volume-title":"Proc. 10th Symp. on Logic in Computer Science, LICS 1995","author":"I. Walukiewicz","year":"1995","unstructured":"Walukiewicz, I.: Completeness of Kozen\u2019s axiomatization of the propositional \u03bc- calculus. In: Proc. 10th Symp. on Logic in Computer Science, LICS 1995, pp. 14\u201324. IEEE, Los Alamitos (1995)"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30579-8_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,15]],"date-time":"2021-11-15T18:48:18Z","timestamp":1637002098000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30579-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540242970","9783540305798"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30579-8_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}