Skip to main content
SpringerLink
Log in

On control of systems modelled as deterministic Rabin automata

  • Published:
Discrete Event Dynamic Systems Aims and scope Submit manuscript

Abstract

Recent results on the control of infinite behaviour of finite automata are extended to allow Rabin acceptance conditions as modelling assumptions as well as specifications. The key result is a fixpoint characterization of the automaton'scontrollability subset—the set of states from which it can be controlled to the satisfaction of its associated specification. The fixpoint characterization allows for straightforward computation of the subset and for effective synthesis of controllers. the results have potential applications to supervisory control synthesis, the synthesis of reactive systems, and decision procedures for modal logics.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • 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.

  • Alpern, B., and Schneider, F. B. 1985. Delining liveness.Information Processing Letters 21: 181–185.

    Google Scholar 

  • Büchi, J. R., and Landweber, L. H. 1969. Solving sequential conditions by finite-state strategies.Transactions of the American Mathematical Society 138: 295–311.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

  • 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.

  • 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.

  • 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.

  • Francez, N. 1986.Fairness. Texts and Monographs in Computer Science. New York: Springer-Verlag.

    Google Scholar 

  • 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.

  • Hossley, R., and Rackoff, C. 1972. The emptiness problem for automata on infinite trees. InSwitching and Automata Theory Symposium, pp. 121–124. IEEE.

  • Kumar, R., Garg, V., and Marcus, S. I. 1992. On supervisory control of sequential behaviors.IEEE Trans. Automatic Control. 37 (12): 1978–1985.

    Google Scholar 

  • 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.

    Google Scholar 

  • Lamport, L. 1977. Proving the correctness of multiprocess programs.ACM Transactions on Software Engineering SE-3(2): 125–143.

    Google Scholar 

  • Manna, Z., and Pnueli, A. 1992.The Temporal Logic of Reactive and Concurrent Systems, volume 1:Specification. New York: Springer-Verlag.

    Google Scholar 

  • McNaughton, R. 1966. Testing and generating infinite sequences by a finite automaton.Information and Control 9: 521–530.

    Google Scholar 

  • 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.

  • 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.

  • Rabin, M. O. 1969. Decidability of second-order theories and automata on infinite trees.American Mathematical Society Transactions 141: 1–35.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • Ramadge, P. J., and Wonham, W. M. 1989. The control of discrete event systems.Proceedings of the IEEE 77 (1): 81–98.

    Google Scholar 

  • Ramadge, P. J. G. 1989. Some tractable supervisory control problems for discrete-event systems modeled by Büchi automata.IEEE Trans. Automatic Control 34(1): 10–19.

    Google Scholar 

  • Safra, S. 1988. On the complexity of ω-automata. In29th Annual Symposium on the Foundations of Computer Science, pp. 319–327.

  • 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.

  • Thistle, J. G. 1992. Controllability subsets of live Rabin automata. In31st IEEE Conference on Decision and Control, pp. 3746–3747.

  • Thistle, J. G. 1994a. Addendum to ‘On control of systems modelled as deterministic Rabin automata’. Contains proofs of intermediate results of article.

  • 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, École des Mines de Paris. Springer-Verlag. Lecture Notes in Control and Information Sciences 199.

  • Thistle, J. G., and Malhamé, R. P. 1994. Control of discrete-event systems under state fairness assumptions. In S. Brlek (Ed.),BMW 94-Méthodes mathématiques pour la synthèse des systèmes informatiques, pp. 57–66. Laboratoire de combinatoire et d'informatique théorique, Département de mathématiques et d'informatique, Université du Québec à Montréal.

  • Thistle, J. G., and Wonham, W. M. 1992. Control of ω-automata, Church's problem, and the emptiness problem for tree ω-automata. In E. Börger, G. Jäger, H. K. Büning, 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.

  • Thistle, J. G., and Wonham, W. M. 1994a. Control of infinite behaviour of finite automata.SIAM J. Control and Optimization 32(4): 1075–1097.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

  • Varaiya, P. 1993. Smart cars on smart roads: Problems of control.IEEE Trans. on Automatic Control 38(2): 195–207.

    Google Scholar 

  • Vardi, M. Y. 1991. Verification of concurrent programs: The automata-theoretic framework.Annals of Pure and Applied Logic 51: 79–98.

    Google Scholar 

  • 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.

  • Young, S., Spanjol, D., and Garg, V. K. 1992. Control of discrete event systems modeled with deterministic Büchi automata. InProceedings of 1992 American Control Conference, pp. 2809–2813.

Download references

Author information

Authors and Affiliations

  1. Département de génie électrique et de génie informatique, École Polytechnique de Montréal, succ. Centre-ville, C.P. 6079, H3C 3A7, Montreal, Quebec, Canada

    J. G. Thistle

Authors
  1. J. G. Thistle
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Thistle, J.G. On control of systems modelled as deterministic Rabin automata. Discrete Event Dyn Syst 5, 357–381 (1995). https://doi.org/10.1007/BF01439153

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01439153

Keywords

Search

Navigation