{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:19:43Z","timestamp":1742617183323,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540600459"},{"type":"electronic","value":"9783540494133"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60045-0_55","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:36:32Z","timestamp":1330277792000},"page":"253-266","source":"Crossref","is-referenced-by-count":5,"title":["The rabin index and chain automata, with applications to automata and games"],"prefix":"10.1007","author":[{"given":"Sriram C.","family":"Krishnan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anuj","family":"Puri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert. K.","family":"Brayton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pravin P.","family":"Varaiya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"21_CR1","unstructured":"O. Carton. Chain Automata. In IFIP 13th World Computer Congress, pages 451\u2013458, August 1994."},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"E. S. Chang, Z. Manna, and A. Pnueli. The Safety-Progress Classification. In F. L. Bauer, W. Bauer, and H. Schwichtenberg, editors, Logic and Algebra of Specification, pages 143\u2013202, 1993.","DOI":"10.1007\/978-3-642-58041-3_5"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"E. A. Emerson. Automata, tableaux, and temporal logics. In Logics of Programs, LNCS, pages 79\u201388. Springer-Verlag, 1985.","DOI":"10.1007\/3-540-15648-8_7"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"E. A. Emerson and C. S. Jutla. The complexity of tree automata and logics of programs. In Proc. of the Symp. on Foundations of Computer Science, pages 328\u2013337, October 1988.","DOI":"10.1109\/SFCS.1988.21949"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"E. A. Emerson and C. S. Jutla. Trees automata, Mu-calculus and determinacy. In Proc. of the Symp. on Foundations of Computer Science, pages 368\u2013377, October 1991.","DOI":"10.1109\/SFCS.1991.185392"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"E. A. Emerson, C. S. Jutla, and A. P. Sistla. On model-checking for fragments of mu-calculus. In Computer Aided Verification, volume 697 of LNCS, pages 385\u2013396. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-56922-7_32"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Y. Gurevich and L. Harrington. Trees, automata, and games. In Proc. of the ACM Symposium on the Theory of Computing, pages 60\u201365, May 1982.","DOI":"10.1145\/800070.802177"},{"key":"21_CR8","unstructured":"C. S. Jutla. Personal communication, February 1995."},{"key":"21_CR9","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(85)90043-X","volume":"36","author":"M. Kaminski","year":"1985","unstructured":"M. Kaminski. A Classification of \u03c9-regular languages. Theoretical Computer Science, 36:217\u2013229, 1985.","journal-title":"Theoretical Computer Science"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"S. C. Krishnan, A. Puri, and R. K. Brayton. Deterministic \u03c9-automata vis-a-vis Deterministic Buchi Automata. In Algorithms and Computation, volume 834 of LNCS, pages 378\u2013386. Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58325-4_202"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"S. C. Krishnan, A. Puri, and R. K. Brayton. Structural Complexity of \u03c9-automata. In Symposium on Theoretical Aspects of Computer Science, volume 900 of LNCS, pages 143\u2013156. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-59042-0_69"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"R. P. Kurshan. Computer-aided Verification of Coordinating Processes: the Automata-theoretic approach. Princeton University Press, 1994.","DOI":"10.1515\/9781400864041"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"O. Maler, A. Pnueli, and J. Sifakis. On the synthesis of Discrete Controllers for Timed Systems. In Symposium on Theoretical Aspects of Computer Science, volume 900 of LNCS, pages 229\u2013242. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-59042-0_76"},{"key":"21_CR14","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0168-0072(93)90036-D","volume":"65","author":"R. McNaughton","year":"1993","unstructured":"R. McNaughton. Infinite gmaes played on finite graphs. Annals of Pure and Applied Logic, 65:149\u2013184, 1993.","journal-title":"Annals of Pure and Applied Logic"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proc. of the ACM Symposium on Principles of Programming Languages, pages 179\u2013180, 1989.","DOI":"10.1145\/75277.75293"},{"key":"21_CR16","volume-title":"volume 13 of Regional Conf. Series in Mathematics","author":"M. O. Rabin","year":"1972","unstructured":"M. O. Rabin. Automata on Infinite Objects and Church's Problem, volume 13 of Regional Conf. Series in Mathematics. American Mathematical Society, Providence, Rhode Island, 1972."},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"S. Safra and M. Y. Vardi. On \u03c9-Automata and Temporal Logic. In Proc. of the ACM Symposium on the Theory of Computing, pages 127\u2013137, May 1989.","DOI":"10.1145\/73007.73019"},{"key":"21_CR18","volume-title":"PhD thesis","author":"S. Safra","year":"1989","unstructured":"Shmuel Safra. Complexity of Automata on Infinite Objects. PhD thesis, The Weizmann Institute of Science, Rehovot, Israel, March 1989."},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"W. Thomas. Automata on Infinite Objects. In J. van Leeuwen, editor, Formal Models and Semantics, volume B of Handbook of Theoretical Computer Science, pages 133\u2013191. Elsevier Science, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"W. Thomas. On the synthesis of strategies in infinite games. In Symposium on Theoretical Aspects of Computer Science, volume 900 of LNCS, pages 1\u201313. Springer-Verlag, 1995.","DOI":"10.1007\/3-540-59042-0_57"},{"key":"21_CR21","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0019-9958(79)90653-3","volume":"43","author":"K. Wagner","year":"1979","unstructured":"K. Wagner. On \u03c9-Regular Sets. Information and Control, 43:123\u2013177, 1979.","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60045-0_55.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:51:51Z","timestamp":1742597511000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60045-0_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540600459","9783540494133"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-60045-0_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}