{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T12:43:25Z","timestamp":1770295405290,"version":"3.49.0"},"reference-count":37,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1987,6,1]],"date-time":"1987-06-01T00:00:00Z","timestamp":549504000000},"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":9543,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1987,6]]},"DOI":"10.1016\/0167-6423(87)90036-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:09:22Z","timestamp":1027656562000},"page":"275-306","source":"Crossref","is-referenced-by-count":163,"title":["Modalities for model checking: branching time logic strikes back"],"prefix":"10.1016","volume":"8","author":[{"given":"E.","family":"Allen Emerson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chin-Laung","family":"Lei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(87)90036-0_bib1","series-title":"PhD Thesis","article-title":"Decidability and expressiveness of logics of processes","author":"Abrahamson","year":"1980"},{"key":"10.1016\/0167-6423(87)90036-0_bib2","series-title":"Protocol Specification, Testing, and Verification III","article-title":"Tools and studies of formal techniques\u2014Petri nets and temporal logic","author":"Antila","year":"1983"},{"issue":"5","key":"10.1016\/0167-6423(87)90036-0_bib3","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1145\/362946.362970","article-title":"A note on reliable full-duplex transmission over half-duplex links","volume":"12","author":"Bartlett","year":"1969","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-6423(87)90036-0_bib4","series-title":"IBM Logics of Programs Workshop","first-page":"52","article-title":"Design and synthesis of synchronization skeletons using branching time temporal logic","volume":"131","author":"Clarke","year":"1981"},{"issue":"2","key":"10.1016\/0167-6423(87)90036-0_bib5","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1145\/5397.5399","article-title":"Automatic verification of finite state concurrent systems using temporal logic","volume":"8","author":"Clarke","year":"1986","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"10.1016\/0167-6423(87)90036-0_bib6","series-title":"CMU Logics of Programs Workshop","first-page":"101","article-title":"Automatic verification of asynchronous circuits","volume":"164","author":"Clarke","year":"1983"},{"key":"10.1016\/0167-6423(87)90036-0_bib7","series-title":"Proc. 7th International Colloquium on Automata, Languages, and Programming","article-title":"Characterizing correctness properties of parallel programs as fixpoints","volume":"85","author":"Emerson","year":"1983"},{"key":"10.1016\/0167-6423(87)90036-0_bib8","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0167-6423(83)90017-5","article-title":"Using branching time temporal logic to synthesize synchronization skeletons","volume":"2","author":"Emerson","year":"1982","journal-title":"Sci. Comput. Programming"},{"issue":"1","key":"10.1016\/0167-6423(87)90036-0_bib9","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."},{"issue":"1","key":"10.1016\/0167-6423(87)90036-0_bib10","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/4904.4999","article-title":"\u2018Sometimes\u2019 and \u2018not never\u2019 revisited: On branching versus linear time temporal logic","volume":"33","author":"Emerson","year":"1986","journal-title":"J. ACM"},{"issue":"3","key":"10.1016\/0167-6423(87)90036-0_bib11","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":"Information and Control"},{"key":"10.1016\/0167-6423(87)90036-0_bib12","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","article-title":"Propositional dynamic logic of regular programs","volume":"18","author":"Ladner","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0167-6423(87)90036-0_bib13","first-page":"46","article-title":"Generalized fair termination","author":"Francez","year":"1984","journal-title":"Proc. 11th Annual ACM Symposium on Principles of Programming Languages"},{"key":"10.1016\/0167-6423(87)90036-0_bib14","first-page":"418","article-title":"A general result on infinite trees and its applications","author":"Harel","year":"1984","journal-title":"Proc. 16th STOC"},{"key":"10.1016\/0167-6423(87)90036-0_bib15","first-page":"1","article-title":"Probabilistic temporal logics for finite and bounded models","author":"Hart","year":"1984","journal-title":"Proc. 16th STOC"},{"key":"10.1016\/0167-6423(87)90036-0_bib17","first-page":"174","article-title":"\u2018Sometimes\u2019 is sometimes \u2018not never\u2019,\u2014on the temporal logic of programs","author":"Lamport","year":"1980","journal-title":"Proc. 7th Annual ACM Symposium on Principles of Programming Languages"},{"key":"10.1016\/0167-6423(87)90036-0_bib18","series-title":"Proc. ICALP '81","first-page":"204","article-title":"Impartiality, justice and fairness: The ethics of concurrent termination","volume":"115","author":"Lehmann","year":"1981"},{"key":"10.1016\/0167-6423(87)90036-0_bib19","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1145\/318593.318622","article-title":"Checking that finite state concurrent programs satisfy their linear specification","author":"Lichtenstein","year":"1985","journal-title":"Proc. POPL '85"},{"key":"10.1016\/0167-6423(87)90036-0_bib20","doi-asserted-by":"crossref","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":"Information and Control"},{"key":"10.1016\/0167-6423(87)90036-0_bib21","series-title":"Introduction to VLSI Systems","author":"Mead","year":"1980"},{"key":"10.1016\/0167-6423(87)90036-0_bib22","first-page":"3","article-title":"Infinite sequences and finite machines","author":"Muller","year":"1963","journal-title":"Proc. 4th Annual IEEE Symposium of Switching Theory and Logical Design"},{"key":"10.1016\/0167-6423(87)90036-0_bib23","author":"Ojala","year":"1984","journal-title":"Personal Communication at ICALP '84"},{"issue":"3","key":"10.1016\/0167-6423(87)90036-0_bib24","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1145\/357172.357178","article-title":"Proving liveness properties of concurrent programs","volume":"4","author":"Owicki","year":"1982","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"10.1016\/0167-6423(87)90036-0_bib25","series-title":"Abstract Software Specification","first-page":"504","article-title":"On the semantics of fair parallelism","volume":"86","author":"Park","year":"1980"},{"key":"10.1016\/0167-6423(87)90036-0_bib26","article-title":"The temporal logic of programs","author":"Pnueli","year":"1977","journal-title":"Proc. 19th Annual symposium on Foundations of Computer Science"},{"key":"10.1016\/0167-6423(87)90036-0_bib27","first-page":"278","article-title":"On the extremely fair termination of probabilistic algorithms","author":"Pnueli","year":"1983","journal-title":"Proc. 15th Annual ACM Symposium on Theory of Computing"},{"key":"10.1016\/0167-6423(87)90036-0_bib28","first-page":"15","article-title":"Linear and branching structures in the semantics and logics of reactive systems","author":"Pnueli","year":"1985","journal-title":"Proc. 12th ICALP"},{"key":"10.1016\/0167-6423(87)90036-0_bib29","first-page":"109","article-title":"Semantical considerations on Floyd-Hoare logic","author":"Pratt","year":"1976","journal-title":"Proc. 17th FOCS"},{"key":"10.1016\/0167-6423(87)90036-0_bib30","first-page":"421","article-title":"A dedicable Mu-calculus","author":"Pratt","year":"1981","journal-title":"Proc. 22nd FOCS"},{"key":"10.1016\/0167-6423(87)90036-0_bib31","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF00265555","article-title":"Fairness and related properties in transition systems","volume":"19","author":"Queille","year":"1983","journal-title":"Acta Informat."},{"key":"10.1016\/0167-6423(87)90036-0_bib32","first-page":"1","article-title":"Decidability of second order theories and automata on infinite trees","volume":"141","author":"Rabin","year":"1969","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0167-6423(87)90036-0_bib33","series-title":"Technical Report no. 37","article-title":"Automata on infinite trees and the synthesis problem","author":"Rabin","year":"1970"},{"issue":"3","key":"10.1016\/0167-6423(87)90036-0_bib34","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/3828.3837","article-title":"The complexity of propositional linear temporal logic","volume":"32","author":"Sistla","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/0167-6423(87)90036-0_bib35","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0019-9958(82)91258-X","article-title":"Propositional dynamic logic of looping and converse","volume":"54","author":"Streett","year":"1982","journal-title":"Information and Control"},{"key":"10.1016\/0167-6423(87)90036-0_bib36","first-page":"465","article-title":"The propositional Mu-calculus is elementary","author":"Streett","year":"1984","journal-title":"Proc. ICALP '84"},{"key":"10.1016\/0167-6423(87)90036-0_bib37","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-6423(87)90036-0_bib38","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0022-0000(86)90026-7","article-title":"Automata theoretic techniques of modal logics of programs","volume":"32","author":"Vardi","year":"1986","journal-title":"J. Comput. System Sci."}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642387900360?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642387900360?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T17:50:52Z","timestamp":1555091452000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167642387900360"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,6]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987,6]]}},"alternative-id":["0167642387900360"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(87)90036-0","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1987,6]]}}}