{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:51:24Z","timestamp":1778298684282,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540656913","type":"print"},{"value":"9783540491163","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-49116-3_48","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T08:56:14Z","timestamp":1187254574000},"page":"510-520","source":"Crossref","is-referenced-by-count":20,"title":["A Modal Fixpoint Logic with Chop"],"prefix":"10.1007","author":[{"given":"Markus","family":"M\u00fcller-Olm","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,4,12]]},"reference":[{"key":"48_CR1","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","volume":"37","author":"J. A. Bergstra","year":"1985","unstructured":"J. A. Bergstra and J. W. Klop. Algebra of communicating processes with abstraction. Theoretical Computer Science, 37:77\u2013121, 1985.","journal-title":"Theoretical Computer Science"},{"key":"48_CR2","doi-asserted-by":"crossref","unstructured":"O. Burkart and J. Esparza. More infinite results. ENTCS, 6, 1997. URL: http:\/\/www.elsevier.nl\/locate\/entcs\/volume6.html","DOI":"10.1016\/S1571-0661(05)80680-2"},{"key":"48_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/3-540-63165-8_198","volume-title":"ICALP\u2019 97","author":"O. Burkart","year":"1997","unstructured":"O. Burkart and B. Steffen. Model checking the full modal mu-calculus for infinite sequential processes. In ICALP\u2019 97, LNCS 1256, 419\u2013429. Springer-Verlag, 1997."},{"key":"48_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0304-3975(92)90278-N","volume":"106","author":"D. Caucal","year":"1992","unstructured":"D. Caucal. On the regular structure of prefix rewriting. Theoretical Computer Science, 106:61\u201386, 1992.","journal-title":"Theoretical Computer Science"},{"key":"48_CR5","series-title":"Lect Notes Comput Sci","volume-title":"CAV\u201997","author":"K. Fisler","year":"1997","unstructured":"K. Fisler. Containment of regular languages in non-regular timing diagram languages is decidable. In CAV\u201997, LNCS 1254. Springer-Verlag, 1997."},{"issue":"2","key":"48_CR6","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1006\/inco.1994.1101","volume":"115","author":"J. F. Groote","year":"1994","unstructured":"J. F. Groote and H. H\u00fcttel. Undecidable equivalences for basic process algebra. Information and Computation, 115(2):354\u2013371, 1994.","journal-title":"Information and Computation"},{"key":"48_CR7","unstructured":"J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979."},{"key":"48_CR8","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D. Kozen","year":"1983","unstructured":"D. Kozen. Results on the propositional mu-calculus. Theoretical Computer Science, 27:333\u2013354, 1983.","journal-title":"Theoretical Computer Science"},{"key":"48_CR9","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF00370554","volume":"47","author":"D. Kozen","year":"1988","unstructured":"D. Kozen. A finite model theorem for the propositional mu-calculus. Studia Logica, 47:233\u2013241, 1988.","journal-title":"Studia Logica"},{"key":"48_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/3-540-60630-0_4","volume-title":"TACAS\u201995","author":"A. Mader","year":"1995","unstructured":"A. Mader. Modal mu-calculus, model checking and Gauss elimination. In TACAS\u201995, LNCS 1019, 72\u201388. Springer-Verlag, 1995."},{"key":"48_CR11","unstructured":"R. Milner. Communication and Concurrency. Prentice Hall, 1989."},{"key":"48_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/3-540-61604-7_56","volume-title":"CONCUR\u201996","author":"F. Moller","year":"1996","unstructured":"F. Moller. Infinite results. In CONCUR\u201996, LNCS 1119, 195\u2013216. Springer-Verlag, 1996."},{"issue":"2","key":"48_CR13","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1109\/MC.1985.1662795","volume":"18","author":"B. Moszkowski","year":"1985","unstructured":"B. Moszkowski. A temporal logic for multi-level reasoning about hardware. IEEE Computer, 18(2):10\u201319, 1985.","journal-title":"IEEE Computer"},{"key":"48_CR14","doi-asserted-by":"crossref","unstructured":"M. M\u00fcller-Olm. Derivation of characteristic formulae. ENTCS, 18, 1998. URL: http:\/\/www.elsevier.nl\/locate\/entcs\/volume18. html","DOI":"10.1016\/S1571-0661(05)80257-9"},{"key":"48_CR15","series-title":"Lect Notes Comput Sci","first-page":"561","volume-title":"Concurrency and automata on infinite sequences","author":"D. M. R. Park","year":"1981","unstructured":"D. M. R. Park. Concurrency and automata on infinite sequences. In LNCS 154, 561\u2013572. Springer-Verlag, 1981."},{"issue":"1","key":"48_CR16","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1006\/inco.1994.1028","volume":"110","author":"B. Steffen","year":"1994","unstructured":"B. Steffen and A. Ing\u00f3lfsd\u00f3ttir. Characteristic formulae for processes with divergence. Information and Computation, 110(1):149\u2013163, 1994.","journal-title":"Information and Computation"},{"issue":"5","key":"48_CR17","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0020-0190(91)90122-X","volume":"40","author":"Z. Chaochen","year":"1991","unstructured":"Zhou Chaochen, C. A. R. Hoare, and A. P. Ravn. A calculus of durations. Information Processing Letters, 40(5):269\u2013276, 1991.","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","STACS 99"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49116-3_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T00:42:55Z","timestamp":1556757775000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49116-3_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540656913","9783540491163"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-49116-3_48","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1999]]}}}