{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:25:39Z","timestamp":1725585939692},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642221187"},{"type":"electronic","value":"9783642221194"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22119-4_13","type":"book-chapter","created":{"date-parts":[[2011,6,15]],"date-time":"2011-06-15T10:21:08Z","timestamp":1308133268000},"page":"149-163","source":"Crossref","is-referenced-by-count":5,"title":["The Modal \u03bc-Calculus Caught Off Guard"],"prefix":"10.1007","author":[{"given":"Oliver","family":"Friedmann","sequence":"first","affiliation":[]},{"given":"Martin","family":"Lange","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/3-540-51803-7_22","volume-title":"Temporal Logic in Specification","author":"B. Banieqbal","year":"1989","unstructured":"Banieqbal, B., Barringer, H.: Temporal logic with fixed points. In: Banieqbal, B., Pnueli, A., Barringer, H. (eds.) Temporal Logic in Specification. LNCS, vol.\u00a0398, pp. 62\u201373. Springer, Heidelberg (1989)"},{"key":"13_CR2","volume-title":"Handbook of Process Algebra","author":"J. Bradfield","year":"2001","unstructured":"Bradfield, J., Stirling, C.: Modal logics and \u03bc-calculi: an introduction. In: Bergstra, J., Ponse, A., Smolka, S. (eds.) Handbook of Process Algebra. Elsevier, Amsterdam (2001)"},{"issue":"1","key":"13_CR3","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-3975(94)90269-0","volume":"126","author":"M. Dam","year":"1994","unstructured":"Dam, M.: CTL* and ECTL* as fragments of the modal \u03bc-calculus. TCS\u00a0126(1), 77\u201396 (1994)","journal-title":"TCS"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/3-540-15648-8_7","volume-title":"Logics of Programs","author":"E.A. Emerson","year":"1985","unstructured":"Emerson, E.A.: Automata, tableaux and temporal logics. In: Parikh, R. (ed.) Logic of Programs 1985. LNCS, vol.\u00a0193, pp. 79\u201387. Springer, Heidelberg (1985)"},{"key":"13_CR5","series-title":"Formal Models and Semantics","first-page":"996","volume-title":"Handbook of Theoretical Computer Science","author":"E.A. Emerson","year":"1990","unstructured":"Emerson, E.A.: Temporal and modal logic. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science. Formal Models and Semantics, vol.\u00a0B, ch. 16, pp. 996\u20131072. Elsevier and MIT Press, New York, USA (1990)"},{"issue":"1","key":"13_CR6","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1137\/S0097539793304741","volume":"29","author":"E.A. Emerson","year":"2000","unstructured":"Emerson, E.A., Jutla, C.S.: The complexity of tree automata and logics of programs. SIAM Journal on Computing\u00a029(1), 132\u2013158 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"13_CR7","first-page":"267","volume-title":"Symposion on Logic in Computer Science","author":"E.A. Emerson","year":"1986","unstructured":"Emerson, E.A., Lei, C.L.: Efficient model checking in fragments of the propositional \u03bc\u2013calculus. In: Symposion on Logic in Computer Science, pp. 267\u2013278. IEEE, Washington, D.C. (1986)"},{"issue":"2","key":"13_CR8","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","volume":"18","author":"M.J. Fischer","year":"1979","unstructured":"Fischer, M.J., Ladner, R.E.: Propositional dynamic logic of regular programs. Journal of Computer and System Sciences\u00a018(2), 194\u2013211 (1979)","journal-title":"Journal of Computer and System Sciences"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Friedmann, O., Lange, M.: A solver for modal fixpoint logics. In: Proc. 6th Workshop on Methods for Modalities, M4M-6. Elect. Notes in Theor. Comp. Sc., vol.\u00a0262, pp. 99\u2013111 (2010)","DOI":"10.1016\/j.entcs.2010.04.008"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-642-02716-1_17","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"N. Jungteerapanich","year":"2009","unstructured":"Jungteerapanich, N.: A tableau system for the modal \u03bc-calculus. In: Giese, M., Waaler, A. (eds.) TABLEAUX 2009. LNCS, vol.\u00a05607, pp. 220\u2013234. Springer, Heidelberg (2009)"},{"key":"13_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"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/3-540-12896-4_370","volume-title":"Logics of Programs","author":"D. Kozen","year":"1984","unstructured":"Kozen, D., Parikh, R.: A decision procedure for the propositional \u03bc-calculus. In: Clarke, E., Kozen, D. (eds.) Logic of Programs 1983. LNCS, vol.\u00a0164, pp. 313\u2013325. Springer, Heidelberg (1984)"},{"issue":"2","key":"13_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":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/3-540-46002-0_20","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R. Mateescu","year":"2002","unstructured":"Mateescu, R.: Local model-checking of modal mu-calculus on acyclic labeled transition systems. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol.\u00a02280, pp. 281\u2013295. Springer, Heidelberg (2002)"},{"issue":"2","key":"13_CR16","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0168-0072(93)90036-D","volume":"65","author":"R. McNaughton","year":"1993","unstructured":"McNaughton, R.: Infinite games played on finite graphs. Annals of Pure and Applied Logic\u00a065(2), 149\u2013184 (1993)","journal-title":"Annals of Pure and Applied Logic"},{"key":"13_CR17","first-page":"255","volume-title":"Proc. 21st Symp.on Logic in Computer Science (LICS 2006)","author":"N. Piterman","year":"2006","unstructured":"Piterman, N.: From nondeterministic B\u00fcchi and Streett automata to deterministic parity automata. In: Proc. 21st Symp.on Logic in Computer Science (LICS 2006), pp. 255\u2013264. IEEE Computer Society, Los Alamitos (2006)"},{"key":"13_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":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-3-540-77050-3_37","volume-title":"FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science","author":"S. Schewe","year":"2007","unstructured":"Schewe, S.: Solving parity games in big steps. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol.\u00a04855, pp. 449\u2013460. Springer, Heidelberg (2007)"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/3-540-13345-3_43","volume-title":"Automata, Languages, and Programming","author":"R.S. Streett","year":"1984","unstructured":"Streett, R.S., Emerson, E.A.: The propositional \u03bc-calculus is elementary. In: Paredaens, J. (ed.) ICALP 1984. LNCS, vol.\u00a0172, pp. 465\u2013472. Springer, Heidelberg (1984)"},{"issue":"3","key":"13_CR21","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0890-5401(89)90031-X","volume":"81","author":"R.S. Streett","year":"1989","unstructured":"Streett, R.S., Emerson, E.A.: An automata theoretic decision procedure for the propositional \u03bc-calculus. Information and Computation\u00a081(3), 249\u2013264 (1989)","journal-title":"Information and Computation"},{"issue":"1\u20132","key":"13_CR22","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1006\/inco.1999.2836","volume":"157","author":"I. Walukiewicz","year":"2000","unstructured":"Walukiewicz, I.: Completeness of Kozen\u2019s axiomatisation of the propositional \u03bc-calculus. Inf. and Comput.\u00a0157(1\u20132), 142\u2013182 (2000)","journal-title":"Inf. and Comput."}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning with Analytic Tableaux and Related Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22119-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T18:07:45Z","timestamp":1553796465000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22119-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642221187","9783642221194"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22119-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}