{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T20:40:04Z","timestamp":1736109604738,"version":"3.32.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":27,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354057879X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0017489","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T07:47:11Z","timestamp":1132645631000},"page":"291-307","source":"Crossref","is-referenced-by-count":1,"title":["On projective and separable properties"],"prefix":"10.1007","author":[{"given":"Doron","family":"Peled","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"M. Abadi, L. Lamport, P. Wolper, Realizable and Unrealizable Concurrent Program Specifications, ICALP 1989, LNCS 372, Springer-Verlag, 1\u201317.","DOI":"10.1007\/BFb0035748"},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1145\/151646.151651","volume":"15","author":"Y. Afek","year":"1993","unstructured":"Y. Afek, G. M. Brown, M. Merritt, Lazy Caching, ACM Transactions on Programming Languages and Systems 15 (1993), 182\u2013205.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/BF01872848","volume":"2","author":"K. Apt","year":"1988","unstructured":"K. Apt, N. Francez, S. Katz, Appraising fairness in languages for distributed programming, Distributed Computing, Vol 2 (1988), 226\u2013241.","journal-title":"Distributed Computing"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(85)90148-3","volume":"39","author":"A. Arnold","year":"1985","unstructured":"A. Arnold, A Syntactic congruence for Rational \u03c9-languages, Theoretical Computer Science 39 (1985), 333\u2013335.","journal-title":"Theoretical Computer Science"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"V. Diekert, Combinatorics on Traces, LNCS 454, Springer-Verlag, 1990.","DOI":"10.1007\/3-540-53031-2"},{"key":"20_CR6","volume-title":"Automata, Languages and Machines, Vol. A","author":"S. Eilenberg","year":"1974","unstructured":"S. Eilenberg, Automata, Languages and Machines, Vol. A, Academic Press, New York, 1974."},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"D. Gabbay, A. Pnueli, S. Shelah, J. Stavi, On the Temporal Analysis of Fairness, ACM Symposium on Principles of Programming Languages, 1980, 163\u2013173.","DOI":"10.1145\/567446.567462"},{"key":"20_CR8","unstructured":"J. E. Hopcroft, J. D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison Wesley, 1979."},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"N. D. Jones, L.H. Landweber, Y. E. Lien, Complexity of some problems in Petri Nets, Theoretical Computer Science 4, 277\u2013299.","DOI":"10.1016\/0304-3975(77)90014-7"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"S. Katz, D. Peled, Interleaving Set Temporal Logic, Theoretical Computer Science, Vol. 75, Number 3, 21\u201343.","DOI":"10.1007\/3-540-51803-7_20"},{"key":"20_CR11","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF02252682","volume":"6","author":"S. Katz","year":"1992","unstructured":"S. Katz, D. Peled, Verification of Distributed Programs using Representative Interleaving Sequences, Distributed Computing (1992) 6, 107\u2013120.","journal-title":"Distributed Computing"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"M. Z. Kwiatkowska, Fairness for Non-interleaving Concurrency, Phd. Thesis, Faculty of Science, University of Leicester, 1989.","DOI":"10.1007\/BF01887206"},{"key":"20_CR13","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L. Lamport","year":"1978","unstructured":"L. Lamport, Time, clocks and the ordering of events in a distributed system, Communications of the ACM 21 (1978), 558\u2013565.","journal-title":"Communications of the ACM"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"L. Lamport, How to make a multiprocess computer that correctly executes multiprocess programs, IEEE Transactions on Computers, Vol. c-28, No. 9, 690\u2013691.","DOI":"10.1109\/TC.1979.1675439"},{"key":"20_CR15","unstructured":"L. Lamport, What good is temporal logic, in R.E.A. Mason (Ed.), Information Processing 83, Elsevier Science Publishers, 1983, 657\u2013668."},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"O. Lichtenstein, A. Pnueli, Checking that finite-state concurrent programs satisfy their linear specification, Proceedings of the 11th ACM Annual Symposium on Principles of Programming Languages, 1984, 97\u2013107.","DOI":"10.1145\/318593.318622"},{"key":"20_CR17","unstructured":"R. McNaughton, S. Papert, Counter-Free Automata, The MIT Press, 1971."},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"A. Nerode, Linear Automaton Transformations, Proceedings AMS 9, 541\u2013544.","DOI":"10.1090\/S0002-9939-1958-0135681-9"},{"key":"20_CR19","unstructured":"C. Papadimitiou, The Theory of Database Concurrency Control, Computer Science Press, 1986."},{"key":"20_CR20","unstructured":"D. Peled, All from One, One for All: on Model Checking using Representatives, Proceedings of Computer Aided Verification 93, Elounda, Greece, LNCS 697, 609\u2013623."},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"D. Peled, S. Katz, A. Pnueli, Specifying and Proving Serializability in Temporal Logic, 6th IEEE annual symposium on Logic in Computer Science, Amsterdam, The Netherlands, July 1991, 232\u2013245.","DOI":"10.1109\/LICS.1991.151648"},{"key":"20_CR22","doi-asserted-by":"crossref","unstructured":"D. Perrin, Recent Results on Automata and Infinite Words, Mathematical Foundations of Computer Science, LNCS 176, Springer Verlag 1984, 134\u2013148.","DOI":"10.1007\/BFb0030294"},{"key":"20_CR23","unstructured":"M. P. Sch\u00fctzenberger, Sur les relations rationnelles functionnelles, in M. Nivat (ed.), Automata, Languages and Programming, North Holland, 103\u2013114."},{"key":"20_CR24","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/3828.3837","volume":"32","author":"A.P. Sistla","year":"1985","unstructured":"A.P. Sistla, E.M. Clarke, The Complexity of Propositional Temporal Logics, Journal of the ACM 32 (1985), 733\u2013749.","journal-title":"Journal of the ACM"},{"key":"20_CR25","doi-asserted-by":"crossref","unstructured":"W. Thomas, Automata on Infinite Objects, in J. Van Leeuwen (ed.), Handbook of Theoretical Computer Science, Vol. B, Elsvier, 133\u2013191.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"20_CR26","volume-title":"Technical report 9202","author":"T. Wilke","year":"1992","unstructured":"T. Wilke, An algebraic theory for regular languages of finite and infinite words, Technical report 9202, 1992, Christian-Albrechts university, Kiel, Germany."},{"key":"20_CR27","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/S0019-9958(83)80051-5","volume":"56","author":"P. Wolper","year":"1983","unstructured":"P. Wolper, Temporal Logic Can be More Expressive, Information and Control 56 (1983), 72\u201399.","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Trees in Algebra and Programming \u2014 CAAP'94"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0017489","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T20:07:49Z","timestamp":1736107669000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0017489"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354057879X"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/bfb0017489","relation":{},"subject":[]}}