{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T23:26:49Z","timestamp":1672615609287},"reference-count":34,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,10,1]],"date-time":"1997-10-01T00:00:00Z","timestamp":875664000000},"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":5768,"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":[[1997,10]]},"DOI":"10.1016\/s0304-3975(96)00225-3","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T19:40:02Z","timestamp":1049744402000},"page":"135-156","source":"Crossref","is-referenced-by-count":4,"title":["On projective and separable properties"],"prefix":"10.1016","volume":"186","author":[{"given":"Doron","family":"Peled","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00225-3_BIB1","series-title":"Proc. 17th Internat. Coll. on Automata, Languages and Programming","first-page":"1","article-title":"Realizable and unrealizable concurrent program specifications","volume":"Vol. 372","author":"Abadi","year":"1989"},{"key":"10.1016\/S0304-3975(96)00225-3_BIB2","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1145\/151646.151651","article-title":"Lazy caching","volume":"15","author":"Afek","year":"1993","journal-title":"ACM Trans. Programming Languages Systems"},{"key":"10.1016\/S0304-3975(96)00225-3_BIB3","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/BF01872848","article-title":"Appraising fairness in languages for distributed programming","volume":"2","author":"Apt","year":"1988","journal-title":"Distributed Comput."},{"key":"10.1016\/S0304-3975(96)00225-3_BIB4","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(96)00225-3_BIB5","article-title":"Combinatorics on Traces","volume":"Vol. 454","author":"Dickert","year":"1990"},{"key":"10.1016\/S0304-3975(96)00225-3_BIB6","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1006\/inco.1995.1010","article-title":"Rational and recognizable trace languages","volume":"116","author":"Dickert","year":"1995","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(96)00225-3_BIB7","volume":"Vol. A","author":"Eilenberg","year":"1974"},{"key":"10.1016\/S0304-3975(96)00225-3_BIB8","series-title":"Proc. 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\/S0304-3975(96)00225-3_BIB9","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1006\/inco.1994.1035","article-title":"A partial approach to model checking","volume":"110","author":"Godefroid","year":"1994","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(96)00225-3_BIB10","article-title":"Design and Validation of Computer Protocols","author":"Holzmann","year":"1992"},{"key":"10.1016\/S0304-3975(96)00225-3_BIB11","series-title":"Proc. 7th Internat. Conf. on Formal Description Techniques","first-page":"197","article-title":"An improvement in formal verification","author":"Holzmann","year":"1994"},{"key":"10.1016\/S0304-3975(96)00225-3_BIB12","series-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0304-3975(96)00225-3_BIB13","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0304-3975(77)90014-7","article-title":"Complexity of some problems in Petri nets","volume":"4","author":"Jones","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00225-3_BIB14","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0304-3975(90)90096-Z","article-title":"Interleaving set temporal logic","volume":"75","author":"Katz","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(96)00225-3_BIB15","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(96)00225-3_BIB16","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(96)00225-3_BIB17","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1109\/TC.1979.1675439","article-title":"How to make a multiprocess computer that correctly executes multiprocess programs","volume":"c-28","author":"Lamport","year":"1979","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0304-3975(96)00225-3_BIB18","first-page":"657","article-title":"What good is temporal logic","volume":"Vol. 83","author":"Lamport","year":"1983"},{"key":"10.1016\/S0304-3975(96)00225-3_BIB19","series-title":"Counter-Free Automata","author":"McNaughton","year":"1971"},{"key":"10.1016\/S0304-3975(96)00225-3_BIB20","series-title":"Advances in Petri Nets","first-page":"279","article-title":"Trace theory","volume":"Vol. 255","author":"Mazurkiewicz","year":"1987"},{"key":"10.1016\/S0304-3975(96)00225-3_BIB21","first-page":"541","article-title":"Linear automaton transformations","volume":"9","author":"Nerode","year":"1958"},{"key":"10.1016\/S0304-3975(96)00225-3_BIB22","series-title":"The Theory of Database Concurrency Control","author":"Papadimitiou","year":"1986"},{"key":"10.1016\/S0304-3975(96)00225-3_BIB23","series-title":"Proc. 5th Internat. Conf. on Computer Aided Verification","first-page":"609","article-title":"All from one, one for all: on model checking using representatives","volume":"Vol. 697","author":"Peled","year":"1993"},{"key":"10.1016\/S0304-3975(96)00225-3_BIB24","series-title":"Proc. 6th Internat. Conf. on Computer Aided Verification","first-page":"377","article-title":"Combining partial order reductions with on-the-fly model-checking","volume":"Vol. 818","author":"Peled","year":"1994"},{"key":"10.1016\/S0304-3975(96)00225-3_BIB25","series-title":"Proc. 6th IEEE Ann. Symp. on Logic in Computer Science","first-page":"232","article-title":"Specifying and proving serializability in temporal logic","author":"Peled","year":"1991"},{"key":"10.1016\/S0304-3975(96)00225-3_BIB26","series-title":"CONCUR'96, 7th Internat. Conf. on Concurrency Theory","article-title":"An algorithmic approach for checking closure properties of \u03c9-regular languages","author":"Peled","year":"1996"},{"key":"10.1016\/S0304-3975(96)00225-3_BIB27","series-title":"Mathematical Foundations of Computer Science","first-page":"134","article-title":"Recent results on automata and infinite words","volume":"Vol. 176","author":"Perrin","year":"1984"},{"key":"10.1016\/S0304-3975(96)00225-3_BIB28","series-title":"Proc. 11th ACM Ann. Symp. on Principles of Programming Languages","first-page":"97","article-title":"Checking that finite-state concurrent programs satisfy their linear specification","author":"Lichtenstein","year":"1984"},{"key":"10.1016\/S0304-3975(96)00225-3_BIB29","series-title":"Automata Languages and Programming","first-page":"103","article-title":"Sur les relations rationnelles functionnelles","author":"Sch\u00fctzenberger","year":"1972"},{"key":"10.1016\/S0304-3975(96)00225-3_BIB30","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/3828.3837","article-title":"The complexity of propositional temporal logics","volume":"32","author":"Sistla","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(96)00225-3_BIB31","first-page":"133","article-title":"Automata on infinite objects","volume":"Vol. B","author":"Thomas","year":"1990"},{"key":"10.1016\/S0304-3975(96)00225-3_BIB32","first-page":"1","article-title":"Stubborn sets for reduced state space generation","volume":"Vol. 2","author":"Valmari","year":"1989"},{"key":"10.1016\/S0304-3975(96)00225-3_BIB33","unstructured":"Th. Wilke and D. Peled, Stutter-invariant temporal properties are expressible without Next-time operator, In preparation."},{"key":"10.1016\/S0304-3975(96)00225-3_BIB34","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:S0304397596002253?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002253?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:25:57Z","timestamp":1556522757000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596002253"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,10]]},"references-count":34,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,10]]}},"alternative-id":["S0304397596002253"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00225-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,10]]}}}