{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T03:24:00Z","timestamp":1777519440456,"version":"3.51.4"},"reference-count":31,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"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":5617,"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,3]]},"DOI":"10.1016\/s0304-3975(97)00219-3","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T04:04:58Z","timestamp":1052798698000},"page":"183-203","source":"Crossref","is-referenced-by-count":32,"title":["An algorithmic approach for checking closure properties of temporal logic specifications and \u03c9-regular languages"],"prefix":"10.1016","volume":"195","author":[{"given":"Doron","family":"Peled","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Wilke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Wolper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00219-3_BIB1","series-title":"Proc. 10th IEEE Symp. on Logic in Computer Science","first-page":"90","article-title":"Model-checking of causality properties","author":"Alur","year":"1995"},{"key":"10.1016\/S0304-3975(97)00219-3_BIB2","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(85)90148-3","article-title":"A syntactic congruence for rational \u03c9-languages","volume":"39","author":"Arnold","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00219-3_BIB3","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1006\/inco.1995.1010","article-title":"Rational and recognizable trace languages","volume":"116","author":"Diekert","year":"1995","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(97)00219-3_BIB4","series-title":"Proc. 2nd Workshop on Computer Aided Verification","first-page":"176","article-title":"Using partial orders to improve automatic verification methods","volume":"vol. 531","author":"Godefroid","year":"1990"},{"key":"10.1016\/S0304-3975(97)00219-3_BIB5","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF02252682","article-title":"Verification of distributed programs using representative interleaving sequences","volume":"6","author":"Katz","year":"1992","journal-title":"Distributed Comput."},{"key":"10.1016\/S0304-3975(97)00219-3_BIB6","series-title":"Proc. 18th IEEE Symp. on Foundations of Computer Science","first-page":"254","article-title":"Lower bounds for natural proof systems","author":"Kozen","year":"1977"},{"key":"10.1016\/S0304-3975(97)00219-3_BIB7","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/BF01887206","article-title":"Event fairness and non-interleaving concurrency","volume":"1","author":"Kwiatkowska","year":"1989","journal-title":"Formal Aspects Comput."},{"key":"10.1016\/S0304-3975(97)00219-3_BIB8","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1109\/TC.1979.1675439","article-title":"How to make a multiprocessor computer that correctly executes multiprocess programs","volume":"28","author":"Lamport","year":"1979","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0304-3975(97)00219-3_BIB9","series-title":"Proc. IFIP Congr. on Information Processing, Elsevier","first-page":"657","article-title":"What good is temporal logic?","author":"Lamport","year":"1983"},{"key":"10.1016\/S0304-3975(97)00219-3_BIB10","series-title":"Proc. Advances in Petri Nets","first-page":"279","article-title":"Trace theory","volume":"vol. 255","author":"Mazurkiewicz","year":"1987"},{"key":"10.1016\/S0304-3975(97)00219-3_BIB11_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-95371-1","article-title":"\u00dcber die Erkennbarkeit unendlicher Spuren","author":"Muscholl","year":"1994"},{"key":"10.1016\/S0304-3975(97)00219-3_BIB11_2","volume":"vol. 17","author":"Muscholl","year":"1996"},{"key":"10.1016\/S0304-3975(97)00219-3_BIB12","series-title":"Automata, Languages, and Programming: 13th Internat. Coll.","first-page":"294","article-title":"Etude Syntaxique des parties reconnaissable de mots infinis","volume":"vol. 226","author":"P\u00e9cuchet","year":"1986"},{"key":"10.1016\/S0304-3975(97)00219-3_BIB13","series-title":"Proc. 5th International Conf. on Computer Aided Verification","first-page":"409","article-title":"All from one, one from all: on model checking using representatives","volume":"vol. 697","author":"Peled","year":"1993"},{"key":"10.1016\/S0304-3975(97)00219-3_BIB14","series-title":"Proc. Coll. on Trees in Algebra and Programming","first-page":"291","article-title":"On projective and separable properties","volume":"vol. 787","author":"Peled","year":"1994"},{"key":"10.1016\/S0304-3975(97)00219-3_BIB15","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF00121262","article-title":"Combining partial-order reductions with on-the-fly model-checking","volume":"8","author":"Peled","year":"1996","journal-title":"Formal Methods System Des."},{"key":"10.1016\/S0304-3975(97)00219-3_BIB16","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0304-3975(94)90009-4","article-title":"Proving partial-order properties","volume":"126","author":"Peled","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00219-3_BIB17","series-title":"CONCUR'96, 7th Internat. Conf. on Concurrency Theory","first-page":"596","article-title":"An algorithmic approach for checking closure properties of \u03c9-regular languages","volume":"vol. 1119","author":"Peled","year":"1996"},{"key":"10.1016\/S0304-3975(97)00219-3_BIB18","series-title":"Proc. 18th IEEE Symp. on Foundation of Computer Science","first-page":"46","article-title":"The temporal logic of programs","author":"Pnueli","year":"1977"},{"key":"10.1016\/S0304-3975(97)00219-3_BIB19","series-title":"Proc. 29th Annual Symp. on Foundations of Computer Science","first-page":"319","article-title":"On the complexity of \u03c9-automata","author":"Safra","year":"1988"},{"key":"10.1016\/S0304-3975(97)00219-3_BIB20","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/3828.3837","article-title":"The complexity of propositional linear temporal logics","volume":"32","author":"Sistla","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(97)00219-3_BIB21","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(87)90008-9","article-title":"The complementation problem for B\u00fcchi automata with applications to temporal logic","volume":"49","author":"Sistla","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00219-3_BIB22","series-title":"Proc. 10th IEEE Symp. on Logic in Computer Science","first-page":"438","article-title":"A trace based extension of linear time temporal logic","author":"Thiagarajan","year":"1994"},{"key":"10.1016\/S0304-3975(97)00219-3_BIB23","series-title":"Proc. 13th IEEE Symp. on Logic in Computer Science","article-title":"An expressively complete linear time temporal logic for mazurkiewicz traces","author":"Thiagarajan","year":"1997"},{"key":"10.1016\/S0304-3975(97)00219-3_BIB24","series-title":"Proc. LITP Spring School on Theoretical Computer Science","first-page":"104","article-title":"Automata and quantifier hierarchies: formal properties of finite automata and applications","volume":"vol. 386","author":"Thomas","year":"1989"},{"key":"10.1016\/S0304-3975(97)00219-3_BIB25","first-page":"133","article-title":"Automata on infinite objects","volume":"vol. B","author":"Thomas","year":"1990"},{"key":"10.1016\/S0304-3975(97)00219-3_BIB26","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF00709154","article-title":"A stubborn attack on state explosion","volume":"1","author":"Valmari","year":"1992","journal-title":"Formal Methods System Des."},{"key":"10.1016\/S0304-3975(97)00219-3_BIB27","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/0022-0000(86)90026-7","article-title":"Automata-theoretic techniques for modal logics of programs","volume":"32","author":"Vardi","year":"1986","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(97)00219-3_BIB28","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)00219-3_BIB29","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"},{"key":"10.1016\/S0304-3975(97)00219-3_BIB30","series-title":"Proc. CONCUR, 4th Conference on Concurrency Theory","first-page":"233","article-title":"Partial-order methods for temporal verification","volume":"vol. 715","author":"Wolper","year":"1993"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597002193?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597002193?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T07:26:24Z","timestamp":1556522784000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597002193"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0304397597002193"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00219-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}