Advertisement

On the synthesis of discrete controllers for timed systems

An extended abstract
  • Oded Maler
  • Amir Pnueli
  • Joseph Sifakis
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 900)

Abstract

This paper presents algorithms for the automatic synthesis of real-time controllers by finding a winning strategy for certain games defined by the timed-automata of Alur and Dill. In such games, the outcome depends on the players' actions as well as on their timing. We believe that these results will pave the way for the application of program synthesis techniques to the construction of real-time embedded systems from their specifications.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AD94]
    R. Alur and D.L. Dill, A Theory of Timed Automata, Theoretical Computer Science 126, 183–235, 1994.Google Scholar
  2. [ACD93]
    R. Alur, C. Courcoubetis, and D.L. Dill, Model Checking in Dense Real Time, Information and Computation 104, 2–34, 1993.Google Scholar
  3. [ALW89]
    M. Abadi, L. Lamport, and P. Wolper, Realizable and Unrealizable Concurrent Program Specifications. In Proc. 16th Int. Collog. Aut. Lang. Prog., volume 372 of Lect. Notes in Comp. Sci., pages 1–17. Springer-Verlag, 1989.Google Scholar
  4. [BW93]
    B.A. Brandin and W.M. Wonham, Supervisory Control of Timed Discreteevent Systems, IEEE Transactions on Automatic Control, 39, 329–342, 1994.Google Scholar
  5. [BL69]
    J.R. Büchi and L.H. Landweber, Solving Sequential Conditions by Finite-state Operators, Trans. of the AMS 138, 295–311, 1969.Google Scholar
  6. [EJ91]
    E.A. Emerson and C.J. Jutla, Tree Automata, μ-calculus and Determinacy, Proc. 32nd FOCS, 1991.Google Scholar
  7. [GH82]
    Y. Gurevich and L. Harrington, Trees, Automata and Games, Proc. 14th STOC, 1982.Google Scholar
  8. [HNSY94]
    T. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine, Symbolic Modelchecking for Real-time Systems, Information and Computation 111, 193–244, 1994.Google Scholar
  9. [LB93]
    M. Le Borgne, Dynamical Systems over Finite Fields, Ph.D. thesis, Univ. Rennes 1, 1993 (In French).Google Scholar
  10. [PR89]
    A. Pnueli and R. Rosner. On the Synthesis of a Reactive Module, In Proc. 16th ACM Symp. Princ. of Prog. Lang., pages 179–190, 1989.Google Scholar
  11. [R72]
    M.O. Rabin, Automata on Infinite Objects and Church's Problem, AMS, 1972.Google Scholar
  12. [RW87]
    P.J. Ramadge and W.M. Wonham, Supervisory Control of a Class of Discrete Event Processes, SIAM J. of Control and Optimization 25, 206–230, 1987.Google Scholar
  13. [RW89]
    P.J. Ramadge and W.M. Wonham, The Control of Discrete Event Systems, Proc. of the IEEE 77, 81–98, 1989.Google Scholar
  14. [TW94a]
    J.G. Thistle and W.M. Wonham, Control of Infinite Behavior of Finite Automata, SIAM J. of Control and Optimization 32, 1075–1097, 1994.Google Scholar
  15. [T94]
    W. Thomas, On the Synthesis of Strategies in Infinite Games, These proceedings.Google Scholar
  16. [TB73]
    B.A. Trakhtenbrot and Y.M. Barzdin, Finite Automata: Behavior and Synthesis, North-Holland, Amsterdam, 1973.Google Scholar
  17. [V94]
    M.Y. Vardi, Personal communication.Google Scholar
  18. [WTH92]
    H. Wong-Toi and G. Hoffmann, The Control of Dense Real-Time Discrete Event Systems, Technical report STAN-CS-92-1411, Stanford University, 1992.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Oded Maler
    • 1
  • Amir Pnueli
    • 2
  • Joseph Sifakis
    • 1
  1. 1.Spectre-Verimag, Miniparc-zirstMontbonnotFrance
  2. 2.Dept. of Computer ScienceWeizmann Inst.RehovotIsrael

Personalised recommendations