{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:53:54Z","timestamp":1750308834624,"version":"3.41.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319601335"},{"type":"electronic","value":"9783319601342"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-60134-2_6","type":"book-chapter","created":{"date-parts":[[2017,5,27]],"date-time":"2017-05-27T12:53:09Z","timestamp":1495889589000},"page":"64-75","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Equivalence of Probabilistic $$\\mu $$-Calculus and p-Automata"],"prefix":"10.1007","author":[{"given":"Claudia","family":"Cauli","sequence":"first","affiliation":[]},{"given":"Nir","family":"Piterman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,28]]},"reference":[{"key":"6_CR1","unstructured":"Arnold, A., Niwi\u0144ski, D.: Rudiments of $$\\mu $$-calculus. Studies in Logic and the Foundations of Mathematics, vol. 146. Elsevier, New York (2001)"},{"key":"6_CR2","volume-title":"Principles of Model Checking","author":"C Baier","year":"2008","unstructured":"Baier, C., Katoen, J.P.: Principles of Model Checking. The MIT Press, Cambridge (2008)"},{"key":"6_CR3","series-title":"Studies in Logic and Practical Reasoning","volume-title":"Handbook of Modal Logic","author":"P Blackburn","year":"2007","unstructured":"Blackburn, P., Benthem, J., Wolter, F.: Handbook of Modal Logic. Studies in Logic and Practical Reasoning. Elsevier, New York (2007)"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Bradfield, J., Stirling, C.: Modal $$\\mu $$-calculi. In: Handbook of Modal Logic, pp. 721\u2013756. Elsevier (2007)","DOI":"10.1016\/S1570-2464(07)80015-2"},{"key":"6_CR5","unstructured":"Bradfield, J., Walukiewicz, I.: The $$\\mu $$-calculus and model-checking. In: Handbook of Model Checking. Springer (2015)"},{"issue":"2","key":"6_CR6","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1093\/jigpal\/jzu030","volume":"23","author":"F Bruse","year":"2015","unstructured":"Bruse, F., Friedmann, O., Lange, M.: On guarded transformation in the modal $$\\mu $$-calculus. Logic J. IGPL 23(2), 194\u2013216 (2015)","journal-title":"Logic J. IGPL"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Cleaveland, R., Purushothaman Iyer, S., Narasimha, M.: Probabilistic temporal logics via the modal $$\\mu $$-calculus. Theor. Comput. Sci. 342(2\u20133), 316\u2013350 (2005)","DOI":"10.1016\/j.tcs.2005.03.048"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Castro, P., Kilmurray, C., Piterman, N.: Tractable probabilistic $$\\mu $$-calculus that expresses probabilistic temporal logics. In: 32nd Symposium on Theoretical Aspects of Computer Science. Schloss Dagstuhl (2015)","DOI":"10.1007\/978-3-319-25423-4_22"},{"key":"6_CR9","unstructured":"Chatterjee, K., Piterman, N.: Obligation Blackwell games and p-Automata. CoRR, abs\/1206.5174 (2013)"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Emerson, E.A., Jutla S.: Tree automata, $$\\mu $$-calculus and determinacy. In: Proceedings of 32nd Annual Symposium on Foundations of Computer Science, pp. 368\u2013377. IEEE (1991)","DOI":"10.1109\/SFCS.1991.185392"},{"key":"6_CR11","unstructured":"Emerson, E.A., Lei, C.-L.: Efficient model checking in fragments of the propositional $$\\mu $$-calculus. In: Proceedings of the First Annual IEEE Symposium on Logic in Computer Science, LICS, pp. 267\u2013278 (1986)"},{"key":"6_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36387-4","volume-title":"Automata Logics, and Infinite Games: A Guide to Current Research","author":"E Gr\u00e4del","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T.: Automata Logics, and Infinite Games: A Guide to Current Research. Springer, New York (2002)"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Huth, M., Kwiatkowska, M.: Quantitative analysis and model checking. In: Proceedings of 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, 29 June\u2013 2 July, pp. 111\u2013122 (1997)","DOI":"10.1109\/LICS.1997.614940"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Janin, D., Walukiewicz, I.: Automata for the modal $$\\mu $$-calculus and related results. Mathematical Foundations of Computer Science, pp. 552\u2013562 (1995)","DOI":"10.1007\/3-540-60246-1_160"},{"issue":"3","key":"6_CR15","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 $$\\mu $$-calculus. Theor. Comput. Sci. 27(3), 333\u2013354 (1983)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"6_CR16","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. J. ACM 47(2), 312\u2013360 (2000)","journal-title":"J. ACM"},{"key":"6_CR17","unstructured":"Mio, M.: Game semantics for probabilistic modal $$\\mu $$-calculi. Ph.D. thesis, University of Edinburgh (2012)"},{"issue":"4","key":"6_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-8(4:18)2012","volume":"8","author":"M Mio","year":"2012","unstructured":"Mio, M.: Probabilistic modal $$\\mu $$-calculus with independent product. Logical Methods Comput. Sci. 8(4), 1\u201336 (2012)","journal-title":"Logical Methods Comput. Sci."},{"key":"6_CR19","unstructured":"Mio, M., Simpson, A.K.: \u0141ukasiewicz $$\\mu $$-calculus. CoRR, abs\/1510.00797 (2015)"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Niwi\u0144ski, D.: Fixed points vs. infinite generation. In: Proceedings of the Third Annual IEEE Symposium on Logic in Computer Science, LICS, pp. 402\u2013409 (1988)","DOI":"10.1109\/LICS.1988.5137"},{"issue":"1\u20132","key":"6_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00039-X","volume":"189","author":"D Niwi\u0144ski","year":"1997","unstructured":"Niwi\u0144ski, D.: Fixed point characterization of infinite behavior of finite-state systems. Theor. Comput. Sci. 189(1\u20132), 1\u201369 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR22","series-title":"Texts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-10778-2","volume-title":"Verification of Reactive Systems: Formal Methods and Algorithms","author":"K Schneider","year":"2004","unstructured":"Schneider, K.: Verification of Reactive Systems: Formal Methods and Algorithms. Texts in Theoretical Computer Science. Springer, Heidelberg (2004)"},{"issue":"2","key":"6_CR23","first-page":"359","volume":"8","author":"T Wilke","year":"2001","unstructured":"Wilke, T.: Alternating tree automata, parity games, and modal $$\\mu $$-calculus. Bull. Soc. Math. Belg. 8(2), 359\u2013391 (2001)","journal-title":"Bull. Soc. Math. Belg."}],"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-60134-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:40:30Z","timestamp":1750279230000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-60134-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319601335","9783319601342"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-60134-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"28 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Implementation and Application of Automata","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marne-la-Vall\u00e9e","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wia2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ciaa17.univ-mlv.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}