Abstract
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.
This research was supported in part by the European Community projects BRAREACT(6021), HYBRID EC-US-043 and INTAS-94-697 as well as by Research Grant #93-012-884 of Russian Foundation of Fundamental Research. Verimag is a joint laboratory of Cnrs, inpg, ujf and Verilog sa. spectre is a project of Inria.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
R. Alur and D.L. Dill, A Theory of Timed Automata, Theoretical Computer Science 126, 183–235, 1994.
R. Alur, C. Courcoubetis, and D.L. Dill, Model Checking in Dense Real Time, Information and Computation 104, 2–34, 1993.
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.
[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.
R.E. Bryant, Graph-based Algorithms for Boolean Function Manipulation, IEEE Trans. on Computers C-35, 677–691, 1986.
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.
B.A. Brandin and W.M. Wonham, Supervisory Control of Timed Discreteevent Systems, IEEE Transactions on Automatic Control, 39, 329–342, 1994.
J.R. Büchi and L.H. Landweber, Solving Sequential Conditions by Finitestate Operators, Trans. of the AMS 138, 295–311, 1969.
A. Church, Logic, Arithmetic and Automata, in Proc. of the Int. Cong. of Mathematicians 1962, 23–35, 1963.
C. Daws, A. Olivero and S. Yovine, Verifying Et-lotos Programs with Kronos, Proc. FORTE'94, Bern, 1994.
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.
E.A. Emerson and E.M. Clarke, Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons, Science of Computer Programming 2, 241–266, 1982.
T. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine, Symbolic Modelchecking for Real-time Systems, Information and Computation 111, 193–244, 1994.
G. Hoffmann and H. Wong-Toi, Symbolic synthesis of supervisory controllers, Proc. of the 1992 American Control Conference, 2789–2793, 1992.
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.
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.
O. Maler and A. Pnueli, Timing Analysis of Asynchronous Circuits using Timed Automata, Proc. Charme'95, to appear, 1995.
Z. Manna and R.J. Waldinger, A Deductive Approach to Program Synthesis, ACM Trans. of Prog. Lang. and Sys. 2, 90–121, 1980.
Z. Manna and P. Wolper, Synthesis of Communication Processes from Temporal Logic Specifications, ACM Trans. of Prog. Lang. and Sys. 6, 68–93, 1984.
K.L. McMillan, Symbolic Model-Checking: an Approach to the State-Explosion problem, Kluwer, 1993.
A. Nerode, A. Yakhnis and V. Yakhnis, Concurrent Programs as Strategies in Games, in Y. Moschovakis (Ed.), Logic From Computer Science, Springer, 1992.
J. von Neumann and O. Morgenstern, Theory of Games and Economic Behavior, Princeton University Press, 1944.
J.S. Ostroff and W.M. Wonham, A Framework for Real-time Discrete Event Control, IEEE Trans. on Automatic Control 35, 386–397, 1990.
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.
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.
P. J. Ramadge and W.M. Wonham, The Control of Discrete Event Systems, Proc. of the IEEE 77, 81–98, 1989.
J.G. Thistle and W.M. Wonham, Control of Infinite Behavior of Finite Automata, SIAM J. of Control and Optimization 32, 1075–1097, 1994.
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.
B.A. Trakhtenbrot and Y.M. Barzdin, Finite Automata: Behavior and Synthesis, North-Holland, Amsterdam, 1973.
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.
H. Wong-Toi and G. Hoffmann, The Control of Dense Real-Time Discrete Event Systems, Technical report STAN-CS-92-1411, Stanford University, 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Asarin, E., Maler, O., Pnueli, A. (1995). Symbolic controller synthesis for discrete and timed systems. In: Antsaklis, P., Kohn, W., Nerode, A., Sastry, S. (eds) Hybrid Systems II. HS 1994. Lecture Notes in Computer Science, vol 999. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60472-3_1
Download citation
DOI: https://doi.org/10.1007/3-540-60472-3_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60472-3
Online ISBN: 978-3-540-47519-4
eBook Packages: Springer Book Archive