Open AccessJournal Article
On the synthesis of discrete controllers for timed systems
Reads0
Chats0
TLDR
In this paper, the authors present 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.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.read more
Citations
More filters
Proceedings ArticleDOI
The theory of hybrid automata
TL;DR: The goal is to demonstrate that concepts from the theory of discrete concurrent systems can give insights into partly continuous systems, and that methods for the verification of finite-state systems can be used to analyze certain systems with uncountable state spaces.
Conflict resolution for air traffic management : a study in mutiagent hybrid systems
TL;DR: In this article, the authors present a method to synthesize provably safe conflict resolution manoeuvres for free flight, in which aircraft choose their own optimal routes, altitudes, and velocities.
Proceedings ArticleDOI
What's decidable about hybrid automata?
TL;DR: It is proved that the reachability problem is undecidable for timed automata augmented with a single stopwatch, and an (optimal) PSPACE reachability algorithm is given for the case of initialized rectangular automata.
Journal ArticleDOI
Controllers for reachability specifications for hybrid systems
TL;DR: This work presents a technique, based on the principles of optimal control, for determining the class of least restrictive controllers that satisfies the most important objective and shows how the proposed synthesis technique simplifies to well-known results from supervisory control and pursuit evasion games when restricted to purely discrete and purely continuous systems respectively.
Journal ArticleDOI
A game theoretic approach to controller design for hybrid systems
TL;DR: This work presents a method to design controllers for safety specifications in hybrid systems, using analysis based on optimal control and game theory for automata and continuous dynamical systems to derive Hamilton-Jacobi equations whose solutions describe the boundaries of reachable sets.
References
More filters
Journal ArticleDOI
A theory of timed automata
Rajeev Alur,David L. Dill +1 more
TL;DR: Alur et al. as discussed by the authors proposed timed automata to model the behavior of real-time systems over time, and showed that the universality problem and the language inclusion problem are solvable only for the deterministic automata: both problems are undecidable (II i-hard) in the non-deterministic case and PSPACE-complete in deterministic case.
Journal ArticleDOI
Supervisory control of a class of discrete event processes
Peter J. Ramadge,W. M. Wonham +1 more
TL;DR: In this paper, the control of a class of discrete event processes, i.e., processes that are discrete, asynchronous and possibly non-deterministic, is studied. And the existence problem for a supervisor is reduced to finding the largest controllable language contained in a given legal language, where the control process is described as the generator of a formal language, while the supervisor is constructed from the grammar of a specified target language that incorporates the desired closed-loop system behavior.
Journal ArticleDOI
The control of discrete event systems
Peter J. Ramadge,W. M. Wonham +1 more
TL;DR: The focus is on the qualitative aspects of control, but computation and the related issue of computational complexity are also considered.
Proceedings ArticleDOI
The theory of hybrid automata
TL;DR: The goal is to demonstrate that concepts from the theory of discrete concurrent systems can give insights into partly continuous systems, and that methods for the verification of finite-state systems can be used to analyze certain systems with uncountable state spaces.
Proceedings ArticleDOI
On the synthesis of a reactive module
Amir Pnueli,Roni Rosner +1 more
TL;DR: An algorithm is presented based on a new procedure for checking the emptiness of Rabin automata on infinite trees in time exponential in the number of pairs, but only polynomial in theNumber of states, which leads to a synthesis algorithm whose complexity is doubleonential in the length of the given specification.