{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:44:55Z","timestamp":1762458295928},"reference-count":19,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4460,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,5]]},"DOI":"10.1016\/s0304-3975(00)00034-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T18:02:56Z","timestamp":1027620176000},"page":"491-522","source":"Crossref","is-referenced-by-count":72,"title":["On model checking for the \u03bc-calculus and its fragments"],"prefix":"10.1016","volume":"258","author":[{"given":"E.Allen","family":"Emerson","sequence":"first","affiliation":[]},{"given":"Charanjit S.","family":"Jutla","sequence":"additional","affiliation":[]},{"given":"A.Prasad","family":"Sistla","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00034-7_BIB1","doi-asserted-by":"crossref","unstructured":"O. Bernholtz, M. Vardi, P. Wolper, An automata theoretic approach to branching time modelchecking. Proc. 6th Internat. Conf. on Computer Aided Verification, CAV \u201994, Stanford, CA, June 1994.","DOI":"10.1007\/3-540-58179-0_50"},{"key":"10.1016\/S0304-3975(00)00034-7_BIB2","first-page":"107","volume":"vol. 1055","author":"Bhatt","year":"1996"},{"key":"10.1016\/S0304-3975(00)00034-7_BIB3","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1007\/BF00264284","article-title":"Tableux-based model checking in the propositional \u03bc-calculus","volume":"27","author":"Cleaveland","year":"1990","journal-title":"Acta Informatica"},{"key":"10.1016\/S0304-3975(00)00034-7_BIB4","doi-asserted-by":"crossref","unstructured":"R. Cleaveland, B. Steffen, A linear-time model checking for alternation free modal \u03bc-calculus, Proc. 3rd Workshop on Computer Aided Verification, Aalborg, Lecture Notes in Computer Science, Springer, Berlin, July 1991.","DOI":"10.1007\/3-540-55179-4_6"},{"key":"10.1016\/S0304-3975(00)00034-7_BIB5","unstructured":"R. Cleaveland, B. Steffen, Faster model checking for modal \u03bc-calculus, Proc. 4th Workshop on Computer Aided Verification, Montreal, July 1991."},{"key":"10.1016\/S0304-3975(00)00034-7_BIB6","doi-asserted-by":"crossref","unstructured":"E.A. Emerson, Automata, tableaux, and temporal logics, Proc. Conf. on Logics of Programs, Brooklyn College, New York, NY, Springer-Verlag Lecture Notes in Computer Science #193, Springer, Berlin, June 1985, pp. 79\u201388.","DOI":"10.1007\/3-540-15648-8_7"},{"key":"10.1016\/S0304-3975(00)00034-7_BIB7","doi-asserted-by":"crossref","unstructured":"E.A. Emerson, E.M. Clarke, Characterizing correctness properties of parallel programs using fixpoints, Proc. Internat. Conf. on Automata, Languages and Programming, 1980.","DOI":"10.1007\/3-540-10003-2_69"},{"key":"10.1016\/S0304-3975(00)00034-7_BIB8","doi-asserted-by":"crossref","unstructured":"E.A. Emerson, C.S. Jutla, Tree automata, mu-calculus and determinacy, Proc. 1991 IEEE Symp. on Foundations of Computer Science.","DOI":"10.1109\/SFCS.1991.185392"},{"key":"10.1016\/S0304-3975(00)00034-7_BIB9","doi-asserted-by":"crossref","unstructured":"E.A. Emerson, C. Jutla, A.P. Sistla, On model checking for fragments of the \u03bc-calculus, Fifth Internat. Conf. on Computer Aided Verification, Elounda, Greece, June\/July 1993.","DOI":"10.1007\/3-540-56922-7_32"},{"key":"10.1016\/S0304-3975(00)00034-7_BIB10","unstructured":"E.A. Emerson, C. Lei, Efficient model checking in fragments of the \u03bc-calculus, Proc. Symp. on Logic in Computer Science, 1986."},{"key":"10.1016\/S0304-3975(00)00034-7_BIB11","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0167-6423(87)90036-0","article-title":"Modalities for model checking","volume":"8","author":"Emerson","year":"1987","journal-title":"Sci. Comput. Programm."},{"issue":"3","key":"10.1016\/S0304-3975(00)00034-7_BIB12","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0020-0190(98)00150-1","article-title":"Deciding the winner in parity games is in UP\u2229co-UP","volume":"68","author":"Jurdzinski","year":"1998","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(00)00034-7_BIB13","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","article-title":"Results on the propositional \u03bc-calculus","volume":"27","author":"Kozen","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00034-7_BIB14","unstructured":"A. Mader, Verification of Modal properties using Boolean equation systems, Munchen Tech-Univ, Dissertation, 1997."},{"key":"10.1016\/S0304-3975(00)00034-7_BIB15","article-title":"Regular Expressions for Infinite trees and a standard form of automata","volume":"vol. 208","author":"Mostowski","year":"1984"},{"key":"10.1016\/S0304-3975(00)00034-7_BIB16","doi-asserted-by":"crossref","unstructured":"D. Niwinski, Fixed-points Vs. Infinite Generation, Proc. 3rd IEEE Symp. on Logic in Computer Science, 1988.","DOI":"10.1109\/LICS.1988.5137"},{"key":"10.1016\/S0304-3975(00)00034-7_BIB17","doi-asserted-by":"crossref","unstructured":"C. Stirling, D. Walker, Local model checking in modal \u03bc-calculus, Proc. TAPSOFT, 1989.","DOI":"10.1007\/3-540-50939-9_144"},{"key":"10.1016\/S0304-3975(00)00034-7_BIB18","unstructured":"R.S. Streett, E.A. Emerson, An automata theoretic decision procedure for Propositional \u03bc-calculus, Proc. Internat. Conf. on Automata, Languages and Programming, 1984."},{"key":"10.1016\/S0304-3975(00)00034-7_BIB19","doi-asserted-by":"crossref","unstructured":"M. Vardi, P. Wolper, Yet Another Process Logic, Proc. Workshop on Logics of Programs, Pittsburgh, 1983, also appeared in Lecture Notes in Computer Science, Springer, Berlin.","DOI":"10.1007\/3-540-12896-4_383"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500000347?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500000347?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,28]],"date-time":"2020-01-28T14:16:33Z","timestamp":1580220993000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500000347"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,5]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,5]]}},"alternative-id":["S0304397500000347"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00034-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2001,5]]}}}