{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T13:19:40Z","timestamp":1715606380372},"reference-count":18,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,6,1]],"date-time":"1999-06-01T00:00:00Z","timestamp":928195200000},"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":5160,"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":[[1999,6]]},"DOI":"10.1016\/s0304-3975(99)00034-1","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T19:40:02Z","timestamp":1049744402000},"page":"251-270","source":"Crossref","is-referenced-by-count":26,"title":["Model checking the full modal mu-calculus for infinite sequential processes"],"prefix":"10.1016","volume":"221","author":[{"given":"Olaf","family":"Burkart","sequence":"first","affiliation":[]},{"given":"Bernhard","family":"Steffen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00034-1_bib1","series-title":"INFINITY '96","first-page":"23","article-title":"More infinite results","volume":"vol. 6","author":"Burkart","year":"1997"},{"key":"10.1016\/S0304-3975(99)00034-1_bib2","series-title":"INFINITY '96","first-page":"15","article-title":"Model-checking of infinite graphs defined by graph grammars","volume":"vol. 6","author":"Burkart","year":"1997"},{"key":"10.1016\/S0304-3975(99)00034-1_bib3","series-title":"CONCUR '96","first-page":"233","article-title":"The modal mu-calculus alternation hierarchy is strict","volume":"vol. 1119","author":"Bradfield","year":"1996"},{"key":"10.1016\/S0304-3975(99)00034-1_bib4","series-title":"CONCUR '92","first-page":"123","article-title":"Model checking for context-free processes","volume":"vol. 630","author":"Burkart","year":"1992"},{"key":"10.1016\/S0304-3975(99)00034-1_bib5","first-page":"89","article-title":"Composition, decomposition and model-checking of pushdown processes","volume":"2","author":"Burkart","year":"1995","journal-title":"Nordic J. Comput."},{"key":"10.1016\/S0304-3975(99)00034-1_bib6","series-title":"INFINITY '97","first-page":"19","article-title":"Model-checking rationally restricted right closures of recognizable graphs","author":"Burkart","year":"1997"},{"key":"10.1016\/S0304-3975(99)00034-1_bib7","series-title":"ICALP '96","first-page":"194","article-title":"On infinite transition graphs having a decidable monadic theory","volume":"vol. 1099","author":"Caucal","year":"1996"},{"key":"10.1016\/S0304-3975(99)00034-1_bib8","series-title":"CAV '92","first-page":"410","article-title":"Faster model checking for the modal mu-calculus","volume":"vol. 663","author":"Cleaveland","year":"1992"},{"key":"10.1016\/S0304-3975(99)00034-1_bib9","first-page":"193","article-title":"Graph rewriting: an algebraic and logic approach","author":"Courcelle","year":"1990"},{"key":"10.1016\/S0304-3975(99)00034-1_bib10","series-title":"CAV '95","first-page":"353","article-title":"On the model checking problem for branching time logics and basic parallel processes","volume":"vol. 939","author":"Esparza","year":"1995"},{"key":"10.1016\/S0304-3975(99)00034-1_bib11","series-title":"CAAP '94","first-page":"115","article-title":"On the decidability of model checking for several \u03bc-calculi and petri nets","volume":"vol. 787","author":"Esparza","year":"1994"},{"issue":"3","key":"10.1016\/S0304-3975(99)00034-1_bib12","first-page":"364","article-title":"Local model-checking for context-free processes","volume":"1","author":"Hungar","year":"1994","journal-title":"Nordic J. Comput."},{"key":"10.1016\/S0304-3975(99)00034-1_bib13","series-title":"CONCUR '96","first-page":"263","article-title":"On the expressive completeness of the propositional mu-calculus wrt monadic second order logic","volume":"vol. 1119","author":"Janin","year":"1996"},{"key":"10.1016\/S0304-3975(99)00034-1_bib14","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(99)00034-1_bib15","series-title":"CAV '94","first-page":"338","article-title":"An improved algorithm for the evaluation of fixpoint expressions","volume":"vol. 818","author":"Long","year":"1994"},{"key":"10.1016\/S0304-3975(99)00034-1_bib16","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0304-3975(85)90087-8","article-title":"The theory of ends, pushdown automata, and second-order logic","volume":"37","author":"Muller","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00034-1_bib17","first-page":"1","article-title":"Decidability of second-order theories and automata on infinite trees","volume":"141","author":"Rabin","year":"1969","journal-title":"Trans. AMS"},{"key":"10.1016\/S0304-3975(99)00034-1_bib18","series-title":"CAV '96","first-page":"62","article-title":"Pushdown processes: games and model-checking","volume":"vol. 1102","author":"Walukiewicz","year":"1996"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599000341?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599000341?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T13:21:14Z","timestamp":1555420874000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599000341"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,6]]},"references-count":18,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,6]]}},"alternative-id":["S0304397599000341"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00034-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,6]]}}}