{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T18:43:22Z","timestamp":1648925002662},"reference-count":22,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,10,1]],"date-time":"1994-10-01T00:00:00Z","timestamp":780969600000},"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":6864,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1994,10]]},"DOI":"10.1016\/s0022-0000(05)80048-0","type":"journal-article","created":{"date-parts":[[2005,8,20]],"date-time":"2005-08-20T07:18:35Z","timestamp":1124522315000},"page":"223-246","source":"Crossref","is-referenced-by-count":2,"title":["A branching time logic with past operators"],"prefix":"10.1016","volume":"49","author":[{"given":"Michael","family":"Kaminski","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(05)80048-0_bib1","series-title":"Logic, Methodology and Philosophy of Science, Proceedings, 1960 Internat, Congr.","first-page":"1","article-title":"On a decision method in restricted second order arithmetic","author":"B\u00fcchi","year":"1962"},{"key":"10.1016\/S0022-0000(05)80048-0_bib2","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1016\/S0022-0000(70)80041-1","article-title":"Tree acceptors and some of their applications","volume":"4","author":"Doner","year":"1970","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(05)80048-0_bib3","series-title":"Proceedings, 14th Annual ACM Symposium on Theory of Computing","first-page":"169","article-title":"Decision procedures and expressiveness in the temporal logic of branching time","author":"Emerson","year":"1982"},{"key":"10.1016\/S0022-0000(05)80048-0_bib4","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/4904.4999","article-title":"\u201cSometimes\u201d and \u201cNot Never\u201d revisited","volume":"33","author":"Emerson","year":"1986","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(05)80048-0_bib5","series-title":"Proceedings, 16th Annual ACM Symposium on Theory of Computing","first-page":"14","article-title":"Deciding branching time logic","author":"Emerson","year":"1984"},{"key":"10.1016\/S0022-0000(05)80048-0_bib6","series-title":"Proceedings, 7th ACM Symposium on Principles of Programming Languages","first-page":"163","article-title":"On the temporal analysis of fairness","author":"Gabbay","year":"1980"},{"key":"10.1016\/S0022-0000(05)80048-0_bib7","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(85)90043-X","article-title":"A classification of \u03c9-regular languages","volume":"36","author":"Kaminski","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0022-0000(05)80048-0_bib8","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0022-0000(92)90012-8","article-title":"Finite automata on directed graphs","volume":"44","author":"Kaminski","year":"1992","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(05)80048-0_bib9","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1093\/logcom\/1.1.71","article-title":"Finite and circular path models for branching time logics","volume":"1","author":"Kaminski","year":"1990","journal-title":"J. Logic Comput."},{"key":"10.1016\/S0022-0000(05)80048-0_bib10","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1007\/BF01691063","article-title":"Decision problems for \u03c9-automata","volume":"3","author":"Landweber","year":"1969","journal-title":"Math. System Theory"},{"key":"10.1016\/S0022-0000(05)80048-0_bib11","series-title":"Logic of Programs","first-page":"196","article-title":"The glory of the past","volume":"Vol. 193","author":"Lichtenstein","year":"1985"},{"key":"10.1016\/S0022-0000(05)80048-0_bib12","series-title":"Theoretical Foundations of Programming Methodology","first-page":"473","article-title":"Behaviors of processes and synchronized systems of processes","author":"Nivat","year":"1982"},{"key":"10.1016\/S0022-0000(05)80048-0_bib13","first-page":"41","article-title":"Automata on infinite objects and their applications to logic and programming","volume":"56","author":"Nivat","year":"1989","journal-title":"Inform. and Control"},{"key":"10.1016\/S0022-0000(05)80048-0_bib14","series-title":"Proceedings, Third Annual ACM Symposium on Principles of Distributed Computing","first-page":"28","article-title":"A temporal logic for reasoning about partially ordered computations","author":"Pinter","year":"1984"},{"key":"10.1016\/S0022-0000(05)80048-0_bib15","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\/S0022-0000(05)80048-0_bib16","series-title":"Mathematical Logic and Foundations of Set Theory","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0049-237X(08)71929-3","article-title":"Weakly definable relations and special automata","author":"Rabin","year":"1970"},{"key":"10.1016\/S0022-0000(05)80048-0_bib17","series-title":"Proceedings, 14th Annual ACM Symposium on Theory of Computing","first-page":"159","article-title":"The complexity of propositional temporal logic","author":"Sistla","year":"1982"},{"key":"10.1016\/S0022-0000(05)80048-0_bib18","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0019-9958(82)91258-X","article-title":"Propositional dynamic logic of looping and converse is elementary decidable","volume":"54","author":"Streett","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/S0022-0000(05)80048-0_bib19","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF01691346","article-title":"Generalized finite automata theory","volume":"2","author":"Thatcher","year":"1970","journal-title":"Math. System Theory"},{"key":"10.1016\/S0022-0000(05)80048-0_bib20","series-title":"Logic of Programs","first-page":"501","article-title":"Yet another process logic","volume":"Vol. 164","author":"Vardi","year":"1984"},{"key":"10.1016\/S0022-0000(05)80048-0_bib21","series-title":"Proceedings, 16th Annual ACM Symposium on Theory of Computing","first-page":"446","article-title":"Automata theoretic techniques for modal logics of programs","author":"Vardi","year":"1984"},{"key":"10.1016\/S0022-0000(05)80048-0_bib22","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. and Control"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800480?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800480?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,22]],"date-time":"2019-01-22T17:27:18Z","timestamp":1548178038000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000005800480"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["S0022000005800480"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(05)80048-0","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}