{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T03:23:39Z","timestamp":1777519419586,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540616047","type":"print"},{"value":"9783540706250","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61604-7_78","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:03:40Z","timestamp":1330275820000},"page":"596-610","source":"Crossref","is-referenced-by-count":10,"title":["An algorithmic approach for checking closure properties of \u03a9-regular languages"],"prefix":"10.1007","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":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"Alur, R., Peled, D., Penczek, W.: Model-checking of causality properties. In Proc. 10th IEEE Symposium on Logic in Computer Science, San Diego, California (1995) 90\u2013100.","DOI":"10.1109\/LICS.1995.523247"},{"key":"35_CR2","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(85)90148-3","volume":"39","author":"A. Arnold","year":"1985","unstructured":"Arnold, A.: A syntactic congruence for rational \u03a9-languages. Theoretical Computer Science 39 (1985) 333\u2013335.","journal-title":"Theoretical Computer Science"},{"key":"35_CR3","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1006\/inco.1995.1010","volume":"116","author":"V. Diekert","year":"1995","unstructured":"Diekert, V., Gastin, P., Petit, A.: Rational and recognizable trace languages. Information and Computation 116 (1995) 134\u2013153.","journal-title":"Information and Computation"},{"key":"35_CR4","first-page":"176","volume-title":"Lect. Notes in Comput. Sci., vol. 531","author":"P. Godefroid","year":"1990","unstructured":"Godefroid, P.: Using partial orders to improve automatic verification methods. In Proc. 2nd Workshop on Computer Aided Verification, New Brunswick, NJ. Lect. Notes in Comput. Sci., vol. 531, Springer (1990) 176\u2013185."},{"key":"35_CR5","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF02252682","volume":"6","author":"S. Katz","year":"1992","unstructured":"Katz, S., Peled, D.: Verification of distributed programs using representative interleaving sequences. Distributed Computing 6 (1992) 107\u2013120.","journal-title":"Distributed Computing"},{"key":"35_CR6","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/BF01887206","volume":"1","author":"M. Z. Kwiatkowska","year":"1989","unstructured":"Kwiatkowska, M. Z.: Event fairness and non-interleaving concurrency. Formal Aspects of Computing 1 (1989) 213\u2013228.","journal-title":"Formal Aspects of Computing"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Kozen, D.: Lower bounds for natural proof systems. 18th IEEE Symposium on Foundations of Computer Science, Providence, Rhode Island (1977) 254\u2013266.","DOI":"10.1109\/SFCS.1977.16"},{"key":"35_CR8","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1109\/TC.1979.1675439","volume":"28","author":"L. Lamport","year":"1979","unstructured":"Lamport, L.: How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Transactions on Computers 28 (1979) 690\u2013691.","journal-title":"IEEE Transactions on Computers"},{"key":"35_CR9","unstructured":"Lamport, L.: What good is temporal logic? In Proc. IFIP Congr. on Information Processing, Elsevier (1983) 657\u2013668."},{"key":"35_CR10","first-page":"279","volume-title":"Lect. Notes in Comput. Sci., vol. 255","author":"A. Mazurkiewicz","year":"1987","unstructured":"Mazurkiewicz, A.: Trace theory. In Proc. Advances in Petri Nets 1986, Bad Honnef, Germany. Lect. Notes in Comput. Sci., vol. 255, Springer (1987) 279\u2013324."},{"key":"35_CR11","first-page":"294","volume-title":"Lect. Notes in Comput. Sci., vol.226","author":"J.-P. P\u00e9cuchet","year":"1986","unstructured":"P\u00e9cuchet, J.-P.: Etude Syntaxique des parties reconnaissable de mots infinis. In Automata, Languages, and Programming: 13th Intern. Coll. Rennes, France. Lect. Notes in Comput. Sci., vol.226, Springer (1986) 294\u2013303."},{"key":"35_CR12","first-page":"291","volume-title":"Lect. Notes in Comput. Sci., vol. 787","author":"D. Peled","year":"1994","unstructured":"Peled, D.: On projective and separable properties. In Proc. Colloquium on Trees in Algebra and Programming, Edinburgh, Scotland. Lect. Notes in Comput. Sci., vol. 787, Springer (1994) 291\u2013307."},{"key":"35_CR13","first-page":"409","volume-title":"Lect. Notes in Comput. Sci., vol.697","author":"D. Peled","year":"1993","unstructured":"Peled, D.: All from One, One from All: on Model Checking using representatives, In Proc. 5th International Conference on Computer Aided Verification, Elounda, Greece, Lect. Notes in Comput. Sci., vol.697, Springer (1993) 409\u2013423."},{"key":"35_CR14","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF00121262","volume":"8","author":"D. Peled","year":"1996","unstructured":"Peled, D.: Combining partial-order reductions with on-the-fly model-checking. Formal Methods in System Design 8 (1996) 39\u201364.","journal-title":"Formal Methods in System Design"},{"key":"35_CR15","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0304-3975(94)90009-4","volume":"126","author":"D. Peled","year":"1994","unstructured":"Peled, D., Pnueli, A.: Proving partial-order properties. Theoretical Computer Science 126 (1994) 143\u2013182.","journal-title":"Theoretical Computer Science"},{"key":"35_CR16","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In Proc. 18th IEEE Symposium on Foundation of Computer Science, Providence, Rhode Island (1977) 46\u201357.","DOI":"10.1109\/SFCS.1977.32"},{"key":"35_CR17","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/3828.3837","volume":"32","author":"A. P. Sistla","year":"1985","unstructured":"Sistla, A. P., Clarke, E. M.: The complexity of propositional linear temporal logics. Journal of the ACM 32 (1985) 733\u2013749.","journal-title":"Journal of the ACM"},{"key":"35_CR18","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(87)90008-9","volume":"49","author":"A. P. Sistla","year":"1987","unstructured":"Sistla, A. P., Vardi, M. Y., Wolper, P.: The complementation problem for B\u00fcchi automata with applications to temporal logic. Theoretical Computer Science 49 (1987) 217\u2013237.","journal-title":"Theoretical Computer Science"},{"key":"35_CR19","doi-asserted-by":"crossref","unstructured":"Thiagarajan, P. S.: A trace based extension of linear time temporal logic. In Proc. 10th IEEE Symposium on Logic in Computer Science, Paris, France (1994) 438\u2013447.","DOI":"10.1109\/LICS.1994.316047"},{"key":"35_CR20","unstructured":"Thomas, W.: Automata and quantifier hierarchies: formal properties of finite automata and applications. In Proc. of LITP Spring School on Theoretical Computer Science, J. E. Pin, ed. Lect. Notes in Comput. Sci., vol. 386, Springer (1989) 104\u2013119."},{"key":"35_CR21","first-page":"133","volume-title":"Handbook of Theoretical Computer Science, vol. B","author":"W. Thomas","year":"1990","unstructured":"Thomas, W.: Automata on infinite objects. In Handbook of Theoretical Computer Science, vol. B, J. van Leeuwen, ed., Elsevier, Amsterdam (1990) 133\u2013191."},{"key":"35_CR22","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF00709154","volume":"1","author":"A. Valmari","year":"1992","unstructured":"Valmari, A.: A stubborn attack on state explosion. Formal Methods in System Design 1 (1992) 297\u2013322.","journal-title":"Formal Methods in System Design"},{"key":"35_CR23","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/0022-0000(86)90026-7","volume":"32","author":"M. Y. Vardi","year":"1986","unstructured":"Vardi, M. Y., Wolper, P.: Automata-theoretic techniques for modal logics of programs. J. Comput. System Sci. 32 (1986) 182\u2013221.","journal-title":"J. Comput. System Sci."},{"key":"35_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1994.1092","volume":"115","author":"M. Y. Vardi","year":"1994","unstructured":"Vardi, M. Y., Wolper, P.: Reasoning about infinite computations. Information and Computation 115 (1994) 1\u201337.","journal-title":"Information and Computation"},{"key":"35_CR25","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/S0019-9958(83)80051-5","volume":"56","author":"P. Wolper","year":"1983","unstructured":"Wolper, P.: Temporal logic can be more expressive. Information and Control 56 (1983) 72\u201399.","journal-title":"Information and Control"},{"key":"35_CR26","first-page":"233","volume-title":"Lect. Notes in Comput. Sci., vol.715","author":"P. Wolper","year":"1993","unstructured":"Wolper, P., Godefroid, P.: Partial-order methods for temporal verification. In Proc. CONCUR, 4th Conference on Concurrency Theory, Hildesheim, Germany. Lect. Notes in Comput. Sci., vol.715, Springer (1993) 233\u2013246."}],"container-title":["Lecture Notes in Computer Science","CONCUR '96: Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61604-7_78.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:35:09Z","timestamp":1619559309000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61604-7_78"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540616047","9783540706250"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-61604-7_78","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}