Theoretical Computer Science
What's decidable about hybrid automata?
Journal of Computer and System Sciences
Model checking
Communication and Concurrency
Series of Abstractions for Hybrid Automata
HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
Reachability Analysis of Hybrid Systems via Predicate Abstraction
HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
Infinite Games and Verification (Extended Abstract of a Tutorial)
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Deterministic Generators and Games for Ltl Fragments
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Reasoning about infinite computation paths
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Symbolic synthesis of finite-state controllers for request-response specifications
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Approximately bisimilar finite abstractions of stable linear systems
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
A fully automated framework for control of linear systems from LTL specifications
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Synthesis of reactive(1) designs
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
A control problem for affine dynamical systems on a full-dimensional polytope
Automatica (Journal of IFAC)
Formal analysis of piecewise affine systems through formula-guided refinement
Automatica (Journal of IFAC)
Temporal logic robot control based on automata learning of environmental dynamics
International Journal of Robotics Research
LTL receding horizon control for finite deterministic systems
Automatica (Journal of IFAC)
Hi-index | 0.00 |
Abstractions (also called symbolic models) are simple descriptions of continuous and hybrid systems that can be used in analysis and control. They are usually constructed in the form of transition systems with finitely many states. Such abstractions offer a very attractive approach to deal with complexity, while at the same time allowing for rich specification languages. Recent results show that, through the abstraction process, the resulting transition systems can be nondeterministic (i.e.,if an input is applied in a state, several next states are possible). However, the problem of controlling a nondeterministic transition system from a rich specification such as a temporal logic formula is not well understood. In this paper, we develop a control strategy for a nondeterministic transition system from a specification given as a Linear Temporal Logic formula with a deterministic Büchi generator. Our solution is inspired by LTL games on graphs, is complete, and scales polynomially with the size of the Büchi automaton. An example of controlling a linear system from a specification given as a temporal logic formula over the regions of its triangulated state space is included for illustration.