Skip to main content
SpringerLink
Log in
Book cover

International Hybrid Systems Workshop

HS 1996: Hybrid Systems IV pp 160–173Cite as

Control theory, modal logic, and games

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1273))

Abstract

We consider a class of discrete systems, with specifications stated in a certain modal temporal language (chosen for simplicity). We show that if the regulator can in some way guarantee satisfaction of a specification, then it can do so acting as a deterministic finite automaton, and we can effectively find an appropriate automaton, or determine that there is none. Our result is not really new. It (and similar results for more expressive languages) can be obtained easily from a result of Landweber and Bfichi on “regular” games, together with the fact that our language gives rise to games of this sort (see the excellent surveys [T] and [E]). We use a result of Gurevich and Harrington [G-H] to show the existence of appropriate automata. The actual construction is explicit. The set of states is determined through elementary considerations of which partial records might be useful to the regulator.

The authors are grateful to Jenny Davoren, Yuri Gurevich, Michael Lemmon, and Anil Nerode.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Büchi, J. R., “On a decision method in restricted second order arithmetic,” in Proc. Internat. Congr. on Logic, Methodology, and Philosophy of Science, ed. by Nagel et al., Stanford Univ. Press, 1960, pp. 1–11.

    Google Scholar 

  2. Wichi, J. R. and L. H. Landweber, “Solving sequential conditions by finite-state strategies,” Trans. Amer. Math. Soc., vol. 138 (1969), pp. 295–311.

    Google Scholar 

  3. Church, A., “Logic, arithmetic, and automata,” in Proc. Internat. Congress Math., 1963, pp. 23–35.

    Google Scholar 

  4. Diekert and Rozenberg, The Book of Traces.

    Google Scholar 

  5. Emerson, E.A., “Temporal and modal logic,” in Handbook of Theoretical Computer Science, vol. B: Formal Models and Semantics, ed. by van Leeuwen, 1990, Elsevier, pp. 997–1072.

    Google Scholar 

  6. Emerson, E. A., and C. S. Jutla, “Tree automata, mu-calculus, and determinacy,” Proc. of the 1991 IEEE Symp. on Foundations of Computer Science, pp. 368–377.

    Google Scholar 

  7. Gurevich, Yu., and L. Harrington, “Automata, trees, and games,” Proc., 14th A. CM. Symposium on the Theory of Computing, San Francisco. 1982.

    Google Scholar 

  8. Knight and Passino, “Decidability for a temporal logic used in discrete event system analysis,” International J. of Control, vol. 52 (1990), pp. 1489–1506.

    Google Scholar 

  9. Landweber, L. H., “Decision problems for w-automata,” Math. Systems Theory, vol. 3 (1969), pp. 376–384.

    Google Scholar 

  10. Luense, Senior Honors Thesis, University of Notre Dame, 1995.

    Google Scholar 

  11. Manna, Z., and A. Pnueli, “Verification of concurrent programs: the temporal framework,” in The Correctness Problem in Computer Science, ed. by R. S. Boyer and J. S. Moore, Academic Press, 1982, pp. 215–273.

    Google Scholar 

  12. Martin, D., “Borel determinacy,” Ann. Math., vol. 102 (1975), pp. 363–371.

    Google Scholar 

  13. McNaughton, R., “Testing and generating infinite sequences by a finite automaton, Inform. and Control, vol. 9 (1966), pp. 521–530.

    Google Scholar 

  14. Muller, D. and Schupp, “Alternating automata on infinite trees,” Theoret, Comput. Sci., vol. 54 (1987), pp. 267–276.

    Google Scholar 

  15. Ostroff, J. S., Real-Time Computer Control of Discrete Systems Modeled by Extended State Machines: a Temporal Logic Approach, Ph.D. dissertation, Department of Electrical Engineering, University of Toronto, 1987.

    Google Scholar 

  16. Rabin, M., “Decidability of second order theories and automata on infinite trees,” Trans. of the Amer. Soc., vol. 141 (1969), pp. 1–35.

    Google Scholar 

  17. Rabin, M., Automata on Infinite Objects and Church's Problem, Ameri. Math. Soc., Providence, 1972.

    Google Scholar 

  18. Thistle, J. G., and W. M. Wonham, “Control problems in a temporal logic framework, International J. of Control, vol. 44 (1985), pp. 943–976.

    Google Scholar 

  19. Thomas, W., “Automata on infinite objects,” in Handbook of Theoretical Computer Science, vol. B: Formal Models and Semantics, ed. by van Leeuwen, 1990, Elsevier, pp. 135–191.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Notre Dame, USA

    Julia. F. Knight

  2. University of Chicago, USA

    Brian Luense

Authors
  1. Julia. F. Knight
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Brian Luense
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Panos Antsaklis Wolf Kohn Anil Nerode Shankar Sastry

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Knight, J.F., Luense, B. (1997). Control theory, modal logic, and games. In: Antsaklis, P., Kohn, W., Nerode, A., Sastry, S. (eds) Hybrid Systems IV. HS 1996. Lecture Notes in Computer Science, vol 1273. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0031560

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63358-7

  • Online ISBN: 978-3-540-69523-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation