{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T07:37:55Z","timestamp":1768289875255,"version":"3.49.0"},"reference-count":25,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1993,6,1]],"date-time":"1993-06-01T00:00:00Z","timestamp":738892800000},"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":7351,"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":[[1993,6]]},"DOI":"10.1016\/0022-0000(93)90005-h","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"271-294","source":"Crossref","is-referenced-by-count":59,"title":["On the expressive power of temporal logic"],"prefix":"10.1016","volume":"46","author":[{"given":"Jo\u00eblle","family":"Cohen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominique","family":"Perrin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Eric","family":"Pin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(93)90005-H_BIB1","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0304-3975(91)90075-D","article-title":"Finite-automaton aperiodicity is PSPACE-complete","volume":"88","author":"Cho","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(93)90005-H_BIB2","series-title":"Proceedings, Hawaii Internat. Conf. Syst. Sci.","first-page":"1","article-title":"On star-free events","author":"Cohen","year":"1968"},{"key":"10.1016\/0022-0000(93)90005-H_BIB3_1","volume":"Vols. A, B","author":"Eilenberg","year":"1974"},{"key":"10.1016\/0022-0000(93)90005-H_BIB3_2","volume":"Vols. A, B","author":"Eilenberg","year":"1976"},{"key":"10.1016\/0022-0000(93)90005-H_BIB4","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/4904.4999","article-title":"\u201cSometimes\u201d and \u201cnot ever\u201d revisited: On branching vs. linear time","volume":"33","author":"Emerson","year":"1986","journal-title":"J. Assoc. Comput. Math."},{"key":"10.1016\/0022-0000(93)90005-H_BIB5","series-title":"Proceedings, 12th ACM Symp. on Principles of Programming Languages","first-page":"163","article-title":"On the temporal analysis of fairness","author":"Gabbay","year":"1980"},{"key":"10.1016\/0022-0000(93)90005-H_BIB6","article-title":"Tense Logic and the Theory of Linear Order","author":"Kamp","year":"1968"},{"key":"10.1016\/0022-0000(93)90005-H_BIB7","article-title":"Completeness and the Expressive Power of Nexttime Temporal Logical System by Semantic Tableau Method","author":"Katai","year":"1981","journal-title":"INRIA Report 109"},{"key":"10.1016\/0022-0000(93)90005-H_BIB8","series-title":"Semigroups and Combinatorial Applications","author":"Lallement","year":"1979"},{"key":"10.1016\/0022-0000(93)90005-H_BIB9","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1145\/321510.321513","article-title":"A note on star-free events","volume":"16","author":"Meyer","year":"1969","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(93)90005-H_BIB10","series-title":"Counter-free Automata","author":"McNaughton","year":"1971"},{"key":"10.1016\/0022-0000(93)90005-H_BIB11","series-title":"Actes des Journ\u00e9es Informatique et Math\u00e9matiques, Luminy","first-page":"74","article-title":"Automates, r\u00e9seaux, formules","author":"Parigot","year":"1984"},{"key":"10.1016\/0022-0000(93)90005-H_BIB12","unstructured":"R. PEIKERT, \u03c9-regular languages and propositional temporal logic, preprint."},{"key":"10.1016\/0022-0000(93)90005-H_BIB13","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/0022-0000(86)90037-1","article-title":"First order logic and star-free sets","volume":"32","author":"Perrin","year":"1986","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(93)90005-H_BIB14","first-page":"2","article-title":"Finite automata","volume":"Vol. B","author":"Perrin","year":"1990"},{"key":"10.1016\/0022-0000(93)90005-H_BIB15","series-title":"Varieties of Formal Languages","author":"Pin","year":"1986"},{"key":"10.1016\/0022-0000(93)90005-H_BIB16","series-title":"Proceedings, 18th FOCS","first-page":"46","article-title":"The temporal logic of programs","author":"Pnueli","year":"1977"},{"key":"10.1016\/0022-0000(93)90005-H_BIB17","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/S0019-9958(65)90108-7","article-title":"On finite monoids having only trivial subgroups","volume":"48","author":"Sch\u00fctzenberger","year":"1965","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(93)90005-H_BIB18","series-title":"Proceedings, Second IEEE Symposium on Logic in Computer Scienced","first-page":"153","article-title":"On the eventually operator in temporal logic","author":"Sistla","year":"1987"},{"key":"10.1016\/0022-0000(93)90005-H_BIB19","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0019-9958(85)80058-9","article-title":"Complexity of some problems from the theory of automata","volume":"66","author":"Stern","year":"1985","journal-title":"Inform and Control"},{"key":"10.1016\/0022-0000(93)90005-H_BIB20","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0001-8708(73)90007-8","article-title":"Extension of the fundamental theorem of finite semigroups","volume":"11","author":"Stiffler","year":"1973","journal-title":"Adv. in Math."},{"key":"10.1016\/0022-0000(93)90005-H_BIB21","article-title":"Varieties of Recognizable Sets Whose Syntactic Monoids Contain Solvable Groups","author":"Straubing","year":"1978"},{"key":"10.1016\/0022-0000(93)90005-H_BIB22","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0022-4049(85)90062-3","article-title":"Finite semigroup varieties of the form V \u2217 D","volume":"36","author":"Straubing","year":"1985","journal-title":"J. Pure Appl. Algebra"},{"key":"10.1016\/0022-0000(93)90005-H_BIB23","first-page":"525","article-title":"Graph algorithms","volume":"Vol. A","author":"Van Leeuwen","year":"1990"},{"key":"10.1016\/0022-0000(93)90005-H_BIB24","series-title":"Applications of temporal logic: An automata-theoretic perspective","author":"Vardi","year":"1985"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009390005H?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002200009390005H?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:57:55Z","timestamp":1550307475000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002200009390005H"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["002200009390005H"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(93)90005-h","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}