{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:21:06Z","timestamp":1725456066562},"publisher-location":"Berlin\/Heidelberg","reference-count":27,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354055789X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0023782","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T05:11:10Z","timestamp":1132377070000},"page":"367-381","source":"Crossref","is-referenced-by-count":7,"title":["Control of \u03c9-automata, Church's problem, and the emptiness problem for tree \u03c9-automata"],"prefix":"10.1007","author":[{"given":"J. G.","family":"Thistle","sequence":"first","affiliation":[]},{"given":"W. M.","family":"Wonham","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Automata, Languages and Programming, 16th International Colloquium","author":"M. Abadi","year":"1989","unstructured":"Martin Abadi, Leslie Lamport, and Pierre Wolper. Realizable and unrealizable specifications of reactive systems. In Automata, Languages and Programming, 16th International Colloquium, Stresa, Italy, July 1989, Proceedings (Lecture Notes in Computer Science no. 372), pages 1\u201317. Springer-Verlag, 1989."},{"key":"29_CR2","first-page":"1","volume-title":"Logic, Methodology and Philosophy of Science","author":"J. R. B\u00fcchi","year":"1962","unstructured":"J. Richard B\u00fcchi. On a decision method in restricted second order arithmetic. In Logic, Methodology and Philosophy of Science, Proceedings of the 1960 International Congress, pages 1\u201311, Stanford, Calif., 1962. Stanford University Press."},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"J. Richard B\u00fcchi. Section 5: Automata and monadic theories. In Saunders MacLane and Dirk Siefkes, editors, The Collected Works of J. Richard B\u00fcchi. Springer-Verlag, 1990.","DOI":"10.1007\/978-1-4613-8928-6_28"},{"key":"29_CR4","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1090\/S0002-9947-1969-0280205-0","volume":"138","author":"J. R. B\u00fcchi","year":"1969","unstructured":"J. Richard B\u00fcchi and Lawrence H. Landweber. Solving sequential conditions by finite-state strategies. Transactions of the American Mathematical Society, 138:295\u2013311, 1969.","journal-title":"Transactions of the American Mathematical Society"},{"key":"29_CR5","first-page":"23","volume-title":"Proceedings of the International Congress of Mathematicians, 15\u201322 August, 1962","author":"A. Church","year":"1963","unstructured":"Alonzo Church. Logic, arithmetic and automata. In Proceedings of the International Congress of Mathematicians, 15\u201322 August, 1962, pages 23\u201335, Djursholm, Sweden, 1963. Institut Mittag-Leffler."},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Constantin Courcoubetis, Moshe Y. Vardi, and Pierre Wolper. Reasoning about fair concurrent programs (extended abstract). In Symposium on the Theory of Computing, pages 283\u2013294. ACM, 1986.","DOI":"10.1145\/12130.12159"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"David L. Dill. Trace Theory for Automatic Hierarchical Verification of Speed-Independent Circuits. ACM Distinguished Dissertations. MIT Press, 1989.","DOI":"10.7551\/mitpress\/6874.001.0001"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"E. Allen Emerson and Charanjit S. Jutla. The complexity of tree automata and logics of programs (extended abstract). In 29th Annual Symposium on Foundations of Computer Science, pages 328\u2013337, 1988.","DOI":"10.1109\/SFCS.1988.21949"},{"key":"29_CR9","unstructured":"E. Allen Emerson and Chin-Laung Lei. Efficient model checking in fragments of the propositional mu-calculus (extended abstract). In Symposium on Logic in Computer Science, pages 267\u2013278. IEEE, June 1986."},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"E. Allen Emerson. Automata, tableaux and temporal logics. In Rohit Parikh, editor, Logics of Programs, (Lecture Notes in Computer Science vol. 193), pages 79\u201387. Springer-Verlag, June 1985.","DOI":"10.1007\/3-540-15648-8_7"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"E. Allen Emerson. Temporal and modal logic. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, vol. B: Formal Models and Semantics. Elsevier, The MIT Press, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50021-4"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Yuri Gurevich and Leo Harrington. Trees, automata and games. In Symposium on the Theory of Computing, pages 60\u201365. ACM, 1982.","DOI":"10.1145\/800070.802177"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"R. Hossley and C. Rackoff. The emptiness problem for automata on infinite trees. In Switching and Automata Theory Symposium, pages 121\u2013124. IEEE, October 1972.","DOI":"10.1109\/SWAT.1972.28"},{"key":"29_CR14","first-page":"300","volume-title":"Information Processing 68","author":"L. H. Landweber","year":"1969","unstructured":"Lawrence H. Landweber. Synthesis algorithms for sequential machines. In Information Processing 68, pages 300\u2013304, Amsterdam, 1969. North-Holland."},{"key":"29_CR15","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/S0019-9958(66)80013-X","volume":"9","author":"R. McNaughton","year":"1966","unstructured":"Robert McNaughton. Testing and generating infinite sequences by a finite automaton. Information and Control, 9:521\u2013530, 1966.","journal-title":"Information and Control"},{"key":"29_CR16","unstructured":"Robert McNaughton. B\u00fcchi's sequential calculus. In Saunders MacLane and Dirk Siefkes, editors, The Collected Works of J. Richard B\u00fcchi, pages 382\u2013397. Springer-Verlag, 1990."},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Amir Pnueli and Roni Rosner. On the synthesis of a reactive module. In Sixteenth Annual Symposium on Principles of Programming Languages, pages 179\u2013190. Association for Computing Machinery, January 1989.","DOI":"10.1145\/75277.75293"},{"key":"29_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1007\/BFb0035790","volume-title":"Automata, Languages and Programming, 16th International Colloquium","author":"A. Pnueli","year":"1989","unstructured":"Amir Pnueli and Roni Rosner. On the synthesis of an asynchronous reactive module. In Automata, Languages and Programming, 16th International Colloquium, Stresa, Italy, July 1989, Proceedings (Lecture Notes in Computer Science no. 372), pages 652\u2013671. Association for Computing Machinery, January 1989."},{"key":"29_CR19","first-page":"1","volume":"141","author":"M. O. Rabin","year":"1969","unstructured":"Michael O. Rabin. Decidability of second-order theories and automata on infinite trees. American Mathematical Society Transactions, 141:1\u201335, July 1969.","journal-title":"American Mathematical Society Transactions"},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"Michael O. Rabin. Weakly definable relations and special automata. In Y. Bar-Hillel, editor, Mathematical Logic and Foundations of Set Theory, pages 1\u201323. North-Holland, 1970.","DOI":"10.1016\/S0049-237X(08)71929-3"},{"key":"29_CR21","volume-title":"Conference Board of the Mathematical Sciences Regional Conference Series in Mathematics No. 13","author":"M. O. Rabin","year":"1972","unstructured":"Michael O. Rabin. Automata on Infinite Objects and Church's Problem. Conference Board of the Mathematical Sciences Regional Conference Series in Mathematics No. 13. American Mathematical Society, Providence, Rhode Island, 1972. Lectures from the CBMS Regional Conference held at Morehouse College, Atlanta, Georgia, September 8\u201312, 1969."},{"key":"29_CR22","doi-asserted-by":"crossref","unstructured":"R.S. Streett. A propositional dynamic logic of looping and converse. Technical Report TR-263, MIT Laboratory for Computer Science, 1981.","DOI":"10.1145\/800076.802492"},{"key":"29_CR23","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A. Tarski","year":"1955","unstructured":"Alfred Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics, 5:285\u2013309, 1955.","journal-title":"Pacific Journal of Mathematics"},{"key":"29_CR24","unstructured":"B.A. Trakhtenbrot and Ya. M. Barzdin'. Finite Automata: Behavior and Synthesis. North-Holland, 1973."},{"key":"29_CR25","volume-title":"PhD thesis","author":"J. G. Thistle","year":"1991","unstructured":"John Graham Thistle. Control of Infinite Behaviour of Discrete-Event Systems. PhD thesis, University of Toronto, Toronto, Canada, January 1991. Available as Systems Control Group Report No. 9012, Systems Control Group, Department of Electrical Engineering, University of Toronto, January 1991."},{"key":"29_CR26","doi-asserted-by":"crossref","unstructured":"Wolfgang Thomas. Automata on infinite objects. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, vol. B: Formal Models and Semantics. Elsevier, The MIT Press, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"29_CR27","volume-title":"Selected Developments in Soviet Cybernetics: Finite Automata, Combinational Complexity, Algorithmic Complexity","author":"B. A. Trakhtenbrot","year":"1986","unstructured":"Boris A. Trakhtenbrot. Selected Developments in Soviet Cybernetics: Finite Automata, Combinational Complexity, Algorithmic Complexity. Delphic Associates Inc., Falls Church, VA, USA, 1986."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0023782","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T21:50:16Z","timestamp":1586555416000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023782"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354055789X"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/bfb0023782","relation":{},"subject":[]}}