Symbolic Controller Synthesis for Discrete and Timed Systems

This paper presents algorithms for the symbolic synthesis of discrete and real-time controllers. At the semantic level the controller is synthesized by nding a winning strategy for certain games de ned by automata or by timed-automata. The algorithms for nding 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 ne-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 cons...

• Type: Conference
• Year: 1994
• Where: HYBRID
• Authors: Eugene Asarin, Oded Maler, Amir Pnueli
• Keywords: Control Systems, HYBRID 1994, Paper Presents Algorithms, Real-time Systems, Symbolic Methods