{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T09:50:16Z","timestamp":1649065816958},"reference-count":25,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":5676,"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":[[1998,1]]},"DOI":"10.1016\/s0304-3975(97)00083-2","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"41-60","source":"Crossref","is-referenced-by-count":1,"title":["Axiomatising extended computation tree logic"],"prefix":"10.1016","volume":"190","author":[{"given":"Roope","family":"Kaivola","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00083-2_BIB1","first-page":"62","article-title":"Temporal logic with fixed points","volume":"vol. 398","author":"Banieqbal","year":"1989"},{"key":"10.1016\/S0304-3975(97)00083-2_BIB2","series-title":"Proc. 13th ACM POPL","article-title":"A really abstract concurrent model and its temporal logic","author":"Barringer","year":"1986"},{"key":"10.1016\/S0304-3975(97)00083-2_BIB3","series-title":"Logic at Botik'89","first-page":"81","article-title":"A synthesis of two approaches for verifying finite state concurrent systems","volume":"vol. 363","author":"Clarke","year":"1989"},{"key":"10.1016\/S0304-3975(97)00083-2_BIB4","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0304-3975(83)90082-8","article-title":"Alternative semantics for temporal logics","volume":"26","author":"Emerson","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00083-2_BIB5","first-page":"997","article-title":"Temporal and modal logic","author":"Emerson","year":"1990"},{"key":"10.1016\/S0304-3975(97)00083-2_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0022-0000(85)90001-7","article-title":"Decision procedures and expressiveness in the temporal logic of branching time","volume":"30","author":"Emerson","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(97)00083-2_BIB7","series-title":"Proc. 32nd FOCS","first-page":"368","article-title":"Tree automata, mu-calculus, and determinacy","author":"Emerson","year":"1991"},{"key":"10.1016\/S0304-3975(97)00083-2_BIB8","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0019-9958(84)80047-9","article-title":"Deciding full branching time logic","volume":"61","author":"Emerson","year":"1984","journal-title":"Inform. Control"},{"key":"10.1016\/S0304-3975(97)00083-2_BIB9","series-title":"Proc. of the 7th ACM POPL","first-page":"163","article-title":"On the temporal analysis of fairness","author":"Gabbay","year":"1980"},{"key":"10.1016\/S0304-3975(97)00083-2_BIB10","series-title":"Proc. CONCUR'95","first-page":"423","article-title":"Axiomatising linear time mu-calculus","volume":"vol. 962","author":"Kaivola","year":"1995"},{"key":"10.1016\/S0304-3975(97)00083-2_BIB11","article-title":"Using automata to characterise fixed point temporal logics","author":"Kaivola","year":"1997"},{"key":"10.1016\/S0304-3975(97)00083-2_BIB12","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(97)00083-2_BIB13","article-title":"Decidability, completeness, and extensions of linear time temporal logic","author":"Lichtenstein","year":"1991"},{"key":"10.1016\/S0304-3975(97)00083-2_BIB14","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/S0019-9958(66)80013-X","article-title":"Testing and generating infinite sequences by a finite automaton","volume":"9","author":"McNaughton","year":"1966","journal-title":"Inform. Control"},{"key":"10.1016\/S0304-3975(97)00083-2_BIB15","series-title":"Computation Theory, Proc. 5th Symp.","first-page":"157","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(97)00083-2_BIB16","first-page":"477","article-title":"Modal and temporal logics","author":"Stirling","year":"1992"},{"key":"10.1016\/S0304-3975(97)00083-2_BIB17","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0304-3975(90)90110-4","article-title":"Local model checking in the modal mu-calculus","volume":"89","author":"Stirling","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00083-2_BIB18","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0890-5401(89)90031-X","article-title":"An automata theoretic decision procedure for the propositional mu-calculus","volume":"81","author":"Streett","year":"1989","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(97)00083-2_BIB19","series-title":"Linear Time, Branching Time and Partial Order in Concurrency","first-page":"690","article-title":"Computation tree logic and regular \u03c9-languages","volume":"vol. 354","author":"Thomas","year":"1988"},{"key":"10.1016\/S0304-3975(97)00083-2_BIB20","first-page":"133","article-title":"Automata on infinite objects","volume":"vol. 2","author":"Thomas","year":"1989"},{"key":"10.1016\/S0304-3975(97)00083-2_BIB21","series-title":"Proc. 15th ACM POPL","first-page":"250","article-title":"A temporal fixpoint calculus","author":"Vardi","year":"1988"},{"key":"10.1016\/S0304-3975(97)00083-2_BIB22","series-title":"Logics of Programs","first-page":"501","article-title":"Yet another process logic","volume":"vol. 164","author":"Vardi","year":"1983"},{"key":"10.1016\/S0304-3975(97)00083-2_BIB23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1994.1092","article-title":"Reasoning about infinite computations","volume":"115","author":"Vardi","year":"1994","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(97)00083-2_BIB24","series-title":"Proc. 10th IEEE LICS","first-page":"14","article-title":"Completeness of Kozen's axiomatisation of the propositional \u03bc-calculus","author":"Walukiewicz","year":"1995"},{"key":"10.1016\/S0304-3975(97)00083-2_BIB25","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/S0019-9958(83)80051-5","article-title":"Temporal logic can be more expressive","volume":"56","author":"Wolper","year":"1983","journal-title":"Inform. Control"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597000832?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597000832?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T12:59:48Z","timestamp":1555419588000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597000832"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0304397597000832"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00083-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}