{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T12:34:26Z","timestamp":1760099666916},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1995,9,1]],"date-time":"1995-09-01T00:00:00Z","timestamp":809913600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Event Dyn Syst"],"published-print":{"date-parts":[[1995,9]]},"DOI":"10.1007\/bf01439153","type":"journal-article","created":{"date-parts":[[2005,4,12]],"date-time":"2005-04-12T12:25:24Z","timestamp":1113308724000},"page":"357-381","source":"Crossref","is-referenced-by-count":18,"title":["On control of systems modelled as deterministic Rabin automata"],"prefix":"10.1007","volume":"5","author":[{"given":"J. G.","family":"Thistle","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., Lamport, L., and Wolper, P. 1989. Realizable and unrealizable specifications of reactive systems. InAutomata, Languages and Programming, 16th International Colloquium, Stresa, Italy, July 1989, Proceedings (Lecture Notes in Computer Science no. 372), pp. 1?17. Springer-Verlag.","DOI":"10.1007\/BFb0035748"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0020-0190(85)90056-0","volume":"21","author":"B. Alpern","year":"1985","unstructured":"Alpern, B., and Schneider, F. B. 1985. Delining liveness.Information Processing Letters 21: 181?185.","journal-title":"Information Processing Letters"},{"key":"CR3","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":"B\u00fcchi, J. R., and Landweber, L. H. 1969. Solving sequential conditions by finite-state strategies.Transactions of the American Mathematical Society 138: 295?311.","journal-title":"Transactions of the American Mathematical Society"},{"key":"CR4","first-page":"23","volume-title":"Proceedings of the International Congress of Mathematicians, 15?22 August, 1962","author":"A. Church","year":"1963","unstructured":"Church, A. 1963. Logic, arithmetic and automata. InProceedings of the International Congress of Mathematicians, 15?22 August, 1962, pp. 23?35, Djursholm, Sweden. Institut Mittag-Leffler."},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"Courcoubetis, C., Vardi, M. Y., and Wolper, P. 1986. Reasoning about fair concurrent programs (extended abstract). InSymposium on the Theory of Computing, pp. 283?294. ACM.","DOI":"10.1145\/12130.12159"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"Emerson, E. A. 1985. Automata, tableaux and temporal logics. In R. Parikh (Ed.),Logics of Programs (Lecture Notes in Computer Science, vol. 193), pp. 79?87. Springer-Verlag.","DOI":"10.1007\/3-540-15648-8_7"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"Emerson, E. A. 1990. Temporal and modal logic. In J. van Leeuwen (Ed.),Handbook of Theoretical Computer Science, vol. B:Formal Models and Semantics, pp. 995?1072. Elsevier, The MIT Press.","DOI":"10.1016\/B978-0-444-88074-1.50021-4"},{"key":"CR8","unstructured":"Emerson, E. A., and Jutla, C. S. 1988. The complexity of tree automata and logics of programs (extended abstract). In29th Annual Symposium on Foundations of Computer Science, pp. 328?337."},{"key":"CR9","series-title":"Texts and Monographs in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4886-6","volume-title":"Fairness","author":"N. Francez","year":"1986","unstructured":"Francez, N. 1986.Fairness. Texts and Monographs in Computer Science. New York: Springer-Verlag."},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"Golaszewski, C. H., and Ramadge, P. J. 1988. Mutual exclusion problems for discrete event systems with shared events. InProc. 27th IEEE Conference on Decision and Control, pp. 234?239.","DOI":"10.1109\/CDC.1988.194301"},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"Hossley, R., and Rackoff, C. 1972. The emptiness problem for automata on infinite trees. InSwitching and Automata Theory Symposium, pp. 121?124. IEEE.","DOI":"10.1109\/SWAT.1972.28"},{"issue":"12","key":"CR12","doi-asserted-by":"crossref","first-page":"1978","DOI":"10.1109\/9.182487","volume":"37","author":"R. Kumar","year":"1992","unstructured":"Kumar, R., Garg, V., and Marcus, S. I. 1992. On supervisory control of sequential behaviors.IEEE Trans. Automatic Control. 37 (12): 1978?1985.","journal-title":"IEEE Trans. Automatic Control."},{"key":"CR13","series-title":"Lecture Notes in Control and Information Sciences","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BFb0042302","volume-title":"Discrete Event Systems: Models and Applications","author":"R. P. Kurshan","year":"1988","unstructured":"Kurshan, R. P. 1988. Reducibility in analysis of coordination. In P. Varaiya and A. B. Kurzhanski (Eds.),Discrete Event Systems: Models and Applications, IIASA Conference, Sopron, Hungary, Aug. 3?7, 1987 (Lecture Notes in Control and Information Sciences, vol. 103), pp. 19?39. New York: Springer-Verlag."},{"issue":"2","key":"CR14","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1109\/TSE.1977.229904","volume":"3","author":"L. Lamport","year":"1977","unstructured":"Lamport, L. 1977. Proving the correctness of multiprocess programs.ACM Transactions on Software Engineering SE-3(2): 125?143.","journal-title":"ACM Transactions on Software Engineering SE"},{"key":"CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0931-7","volume-title":"The Temporal Logic of Reactive and Concurrent Systems, volume 1:Specification","author":"Z. Manna","year":"1992","unstructured":"Manna, Z., and Pnueli, A. 1992.The Temporal Logic of Reactive and Concurrent Systems, volume 1:Specification. New York: Springer-Verlag."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/S0019-9958(66)80013-X","volume":"9","author":"R. McNaughton","year":"1966","unstructured":"McNaughton, R. 1966. Testing and generating infinite sequences by a finite automaton.Information and Control 9: 521?530.","journal-title":"Information and Control"},{"key":"CR17","doi-asserted-by":"crossref","unstructured":"Pnueli, A., and Rosner, R. 1989a. On the synthesis of a reactive module. InSixteenth Annual Symposium on Principles of Programming Languages, pp. 179?190. Association for Computing Machinery.","DOI":"10.1145\/75277.75293"},{"key":"CR18","doi-asserted-by":"crossref","unstructured":"Pnueli, A., and Rosner, R. 1989b. On the synthesis of an asynchronous reactive module. InAutomata, Languages and Programming, 16th International Colloquium, Stresa, Italy, July 1989, Proceedings (Lecture Notes in Computer Science no. 372), pp. 652?671. Association for Computing Machinery. Springer-Verlag.","DOI":"10.1007\/BFb0035790"},{"key":"CR19","first-page":"1","volume":"141","author":"M. O. Rabin","year":"1969","unstructured":"Rabin, M. O. 1969. Decidability of second-order theories and automata on infinite trees.American Mathematical Society Transactions 141: 1?35.","journal-title":"American Mathematical Society Transactions"},{"key":"CR20","series-title":"Conference Board of the Mathematical Sciences Regional Conference Series in Mathematics","doi-asserted-by":"crossref","DOI":"10.1090\/cbms\/013","volume-title":"Automata on Infinite Objects and Church's Problem","author":"M. O. Rabin","year":"1972","unstructured":"Rabin, M. O. 1972.Automata on Infinite Objects and Church's Problem. Conference Board of the Mathematical Sciences Regional Conference Series in Mathematics No. 13. Providence, RI: American Mathematical Society. Lectures from the CBMS Regional Conference held at Morehouse College, Atlanta, Georgia, September 8?12, 1969."},{"issue":"1","key":"CR21","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1137\/0325013","volume":"25","author":"P. J. Ramadge","year":"1987","unstructured":"Ramadge, P. J., and Wonham, W. M. 1987. Supervisory control of a class of discrete event processes.SIAM J. Control and Optimization 25(1): 206?230.","journal-title":"SIAM J. Control and Optimization"},{"issue":"1","key":"CR22","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1109\/5.21072","volume":"77","author":"P. J. Ramadge","year":"1989","unstructured":"Ramadge, P. J., and Wonham, W. M. 1989. The control of discrete event systems.Proceedings of the IEEE 77 (1): 81?98.","journal-title":"Proceedings of the IEEE"},{"issue":"1","key":"CR23","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1109\/9.8645","volume":"34","author":"P. J. G. Ramadge","year":"1989","unstructured":"Ramadge, P. J. G. 1989. Some tractable supervisory control problems for discrete-event systems modeled by B\u00fcchi automata.IEEE Trans. Automatic Control 34(1): 10?19.","journal-title":"IEEE Trans. Automatic Control"},{"key":"CR24","unstructured":"Safra, S. 1988. On the complexity of ?-automata. In29th Annual Symposium on the Foundations of Computer Science, pp. 319?327."},{"key":"CR25","unstructured":"Thistle, J. G. 1991.Control of Infinite Behaviour of Discrete-Event Systems. Ph.D. thesis, University of Toronto, Toronto, Canada. Available as Systems Control Group Report No. 9012, Systems Control Group, Dept. of Electl. Engrg., Univ. of Toronto, January 1991."},{"key":"CR26","doi-asserted-by":"crossref","unstructured":"Thistle, J. G. 1992. Controllability subsets of live Rabin automata. In31st IEEE Conference on Decision and Control, pp. 3746?3747.","DOI":"10.1109\/CDC.1992.371185"},{"key":"CR27","unstructured":"Thistle, J. G. 1994a. Addendum to ?On control of systems modelled as deterministic Rabin automata?. Contains proofs of intermediate results of article."},{"key":"CR28","doi-asserted-by":"crossref","unstructured":"Thistle, J. G. 1994b. Logical aspects of control of discrete event systems: A survey of tools and techniques. In G. Cohen and J.-P. Quadrat (Eds.),11th Int'l Conf. on Analysis and Optimization of Systems, Discrete Event Systems, Sophia-Antipolis, June 15?16?17, 1994, pp. 3?15. INRIA, \u00c9cole des Mines de Paris. Springer-Verlag. Lecture Notes in Control and Information Sciences 199.","DOI":"10.1007\/BFb0033527"},{"key":"CR29","unstructured":"Thistle, J. G., and Malham\u00e9, R. P. 1994. Control of discrete-event systems under state fairness assumptions. In S. Brlek (Ed.),BMW 94-M\u00e9thodes math\u00e9matiques pour la synth\u00e8se des syst\u00e8mes informatiques, pp. 57?66. Laboratoire de combinatoire et d'informatique th\u00e9orique, D\u00e9partement de math\u00e9matiques et d'informatique, Universit\u00e9 du Qu\u00e9bec \u00e0 Montr\u00e9al."},{"key":"CR30","doi-asserted-by":"crossref","unstructured":"Thistle, J. G., and Wonham, W. M. 1992. Control of ?-automata, Church's problem, and the emptiness problem for tree ?-automata. In E. B\u00f6rger, G. J\u00e4ger, H. K. B\u00fcning, and M. M. Richter (Eds.),Computer Science Logic: 5th Workshop, CSL '91, Berne, Switzerland, October 1991, Proceedings (Lecture Notes in Computer Science vol. 626), pp. 367?381. Berlin: Springer-Verlag.","DOI":"10.1007\/BFb0023782"},{"issue":"4","key":"CR31","doi-asserted-by":"crossref","first-page":"1075","DOI":"10.1137\/S0363012991217536","volume":"32","author":"J. G. Thistle","year":"1994","unstructured":"Thistle, J. G., and Wonham, W. M. 1994a. Control of infinite behaviour of finite automata.SIAM J. Control and Optimization 32(4): 1075?1097.","journal-title":"SIAM J. Control and Optimization"},{"issue":"4","key":"CR32","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1137\/S0363012991217524","volume":"32","author":"J. G. Thistle","year":"1994","unstructured":"Thistle, J. G., and Wonham, W. M. 1994b. Supervision of infinite behaviour of discrete-event systems.SIAM J. Control and Optimization 32(4): 1098?1113.","journal-title":"SIAM J. Control and Optimization"},{"key":"CR33","doi-asserted-by":"crossref","unstructured":"Thomas, W. 1990. Automata on infinite objects. In J. van Leeuwen (Ed.),Handbook of Theoretical Computer Science, vol. B: Formal Models and Semantics, pp. 134?191. Elsevier, The MIT Press.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"issue":"2","key":"CR34","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1109\/9.250509","volume":"38","author":"P. Varaiya","year":"1993","unstructured":"Varaiya, P. 1993. Smart cars on smart roads: Problems of control.IEEE Trans. on Automatic Control 38(2): 195?207.","journal-title":"IEEE Trans. on Automatic Control"},{"key":"CR35","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0168-0072(91)90066-U","volume":"51","author":"M. Y. Vardi","year":"1991","unstructured":"Vardi, M. Y. 1991. Verification of concurrent programs: The automata-theoretic framework.Annals of Pure and Applied Logic 51: 79?98.","journal-title":"Annals of Pure and Applied Logic"},{"key":"CR36","doi-asserted-by":"crossref","unstructured":"Wong-Toi, H., and Dill, D. L. 1991. Synthesizing processes and schedulers from temporal specifications. InComputer-Aided Verification (Proceedings of the CAV 90 Workshop) DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 3, pp. 272?281. American Mathematical Society.","DOI":"10.1090\/dimacs\/003\/13"},{"key":"CR37","doi-asserted-by":"crossref","unstructured":"Young, S., Spanjol, D., and Garg, V. K. 1992. Control of discrete event systems modeled with deterministic B\u00fcchi automata. InProceedings of 1992 American Control Conference, pp. 2809?2813.","DOI":"10.23919\/ACC.1992.4792656"}],"container-title":["Discrete Event Dynamic Systems: Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01439153.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01439153\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01439153","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T22:03:55Z","timestamp":1683065035000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01439153"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":37,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["BF01439153"],"URL":"https:\/\/doi.org\/10.1007\/bf01439153","relation":{},"ISSN":["0924-6703","1573-7594"],"issn-type":[{"value":"0924-6703","type":"print"},{"value":"1573-7594","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}