Symbolic controller synthesis for discrete and timed systems

  • Eugene Asarin
  • Oded Maler
  • Amir Pnueli
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 999)


This paper presents algorithms for the symbolic synthesis of discrete and real-time controllers. At the semantic level the controller is synthesized by finding a winning strategy for certain games defined by automata or by timed-automata. The algorithms for finding such strategies need, this way or another, to search the state-space of the system which grows exponentially with the number of components. Symbolic methods allow such a search to be conducted without necessarily enumerating the state-space. This is achieved by representing sets of states using formulae (syntactic objects) over state variables. Although in the worst case such methods are as bad as enumerative ones, many huge practical problems can be treated by fine-tuned symbolic methods. In this paper the scope of these methods is extended from analysis to synthesis and from purely discrete systems to real-time systems.

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 and to a solution of other related design problems associated with real-time systems in general and asynchronous circuits in particular.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  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 ICALP, volume 372 of Lect. Notes in Comp. Sci., pages 1–17. Springer-Verlag, 1989.Google Scholar
  4. [BHG+93]
    [BHG+93] S. Balemi, G.J. Hoffmann, P. Gyugyi, H. Wong-Toi and G.F. Franklin, Supervisory Control of a Rapid Thermal Multiprocessor, IEEE Trans. on Automatic Control 38, 1040–1059, 1993.Google Scholar
  5. [Bry86]
    R.E. Bryant, Graph-based Algorithms for Boolean Function Manipulation, IEEE Trans. on Computers C-35, 677–691, 1986.Google Scholar
  6. [BCM+93]
    J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and L.J. Hwang, Symbolic Model-Checking: 1020 States and Beyond, Proc. LICS'90, Philadelphia, 1990.Google Scholar
  7. [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
  8. [BL69]
    J.R. Büchi and L.H. Landweber, Solving Sequential Conditions by Finitestate Operators, Trans. of the AMS 138, 295–311, 1969.Google Scholar
  9. [Chu63]
    A. Church, Logic, Arithmetic and Automata, in Proc. of the Int. Cong. of Mathematicians 1962, 23–35, 1963.Google Scholar
  10. [DOY94]
    C. Daws, A. Olivero and S. Yovine, Verifying Et-lotos Programs with Kronos, Proc. FORTE'94, Bern, 1994.Google Scholar
  11. [Dil89]
    D.L. Dill, Timing Assumptions and Verification of Finite-State Concurrent Systems, in J. Sifakis (Ed.), Automatic Verification Methods for Finite State Systems, volume 407 of Lect. Notes in Comp. Sci., Springer, 1989.Google Scholar
  12. [EC82]
    E.A. Emerson and E.M. Clarke, Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons, Science of Computer Programming 2, 241–266, 1982.Google Scholar
  13. [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
  14. [HW92-a]
    G. Hoffmann and H. Wong-Toi, Symbolic synthesis of supervisory controllers, Proc. of the 1992 American Control Conference, 2789–2793, 1992.Google Scholar
  15. [HW92-b]
    G. Hoffmann and H. Wong-Toi, Symbolic Supervisory Synthesis for the Animal Maze, Proc. of Workshop on Discrete Event Systems, 189–197, Birkhauser Verlag, 1992.Google Scholar
  16. [MPS95]
    O. Maler, A. Pnueli and J. Sifakis, On the Synthesis of Discrete Controllers for Timed Systems, In E.W. Mayr and C. Puech (Eds.), Proc. STACS '95, volume 900 of Lect. Notes in Comp. Sci., 229–242, Springer-Verlag, 1995.Google Scholar
  17. [MP95]
    O. Maler and A. Pnueli, Timing Analysis of Asynchronous Circuits using Timed Automata, Proc. Charme'95, to appear, 1995.Google Scholar
  18. [MWa80]
    Z. Manna and R.J. Waldinger, A Deductive Approach to Program Synthesis, ACM Trans. of Prog. Lang. and Sys. 2, 90–121, 1980.Google Scholar
  19. [MWo84]
    Z. Manna and P. Wolper, Synthesis of Communication Processes from Temporal Logic Specifications, ACM Trans. of Prog. Lang. and Sys. 6, 68–93, 1984.Google Scholar
  20. [McM93]
    K.L. McMillan, Symbolic Model-Checking: an Approach to the State-Explosion problem, Kluwer, 1993.Google Scholar
  21. [NYY92]
    A. Nerode, A. Yakhnis and V. Yakhnis, Concurrent Programs as Strategies in Games, in Y. Moschovakis (Ed.), Logic From Computer Science, Springer, 1992.Google Scholar
  22. [NM44]
    J. von Neumann and O. Morgenstern, Theory of Games and Economic Behavior, Princeton University Press, 1944.Google Scholar
  23. [OW90]
    J.S. Ostroff and W.M. Wonham, A Framework for Real-time Discrete Event Control, IEEE Trans. on Automatic Control 35, 386–397, 1990.Google Scholar
  24. [PR89-a]
    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
  25. [PR89-b]
    A. Pnueli and R. Rosner. On the Synthesis of an Asynchronous Reactive Module, In Proc. 16th ICALP, volume 372 of Lect. Notes in Comp. Sci., 653–671, 1989.Google Scholar
  26. [RW89]
    P. J. Ramadge and W.M. Wonham, The Control of Discrete Event Systems, Proc. of the IEEE 77, 81–98, 1989.Google Scholar
  27. [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
  28. [Tho94]
    W. Thomas, On the Synthesis of Strategies in Infinite Games, In E.W. Mayr and C. Puech (Eds.), Proc. STACS '95, volume 900 of Lect. Notes in Comp. Sci., 1–13, Springer-Verlag, 1995.Google Scholar
  29. [TB73]
    B.A. Trakhtenbrot and Y.M. Barzdin, Finite Automata: Behavior and Synthesis, North-Holland, Amsterdam, 1973.Google Scholar
  30. [WD91]
    H. Wong-Toi and D.L. Dill, Synthesizing Processes and Schedulers from Temporal Specifications, in E.M. Clarke and R.P. Kurshan (Eds.), Computer-Aided Verification '90, DIMACS Series, AMS, 177–186, 1991.Google Scholar
  31. [WH92]
    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

  • Eugene Asarin
    • 1
  • Oded Maler
    • 2
  • Amir Pnueli
    • 3
  1. 1.Institute for Information Transmission ProblemsMoscowRussia
  2. 2.Spectre-Verimag, Miniparc-zirstMontbonnotFrance
  3. 3.Dept. of Computer ScienceWeizmann Inst.RehovotIsrael

Personalised recommendations