Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Theoretical Computer Science
Mathematical control theory: deterministic finite dimensional systems (2nd ed.)
Mathematical control theory: deterministic finite dimensional systems (2nd ed.)
Communication and Concurrency
Hybrid Automata with Finite Bisimulatioins
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Approximately bisimilar symbolic models for nonlinear control systems
Automatica (Journal of IFAC)
Symbolic Models for Nonlinear Control Systems: Alternating Approximate Bisimulations
SIAM Journal on Control and Optimization
Verification and Control of Hybrid Systems: A Symbolic Approach
Verification and Control of Hybrid Systems: A Symbolic Approach
Approximately bisimilar finite abstractions of stable linear systems
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
SpaceEx: scalable verification of hybrid systems
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Reachability of uncertain linear systems using zonotopes
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Specification-guided controller synthesis for linear systems and safe linear-time temporal logic
Proceedings of the 16th international conference on Hybrid systems: computation and control
Symbolic control of stochastic switched systems via finite abstractions
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
Hi-index | 0.00 |
Symbolic approaches to control hybrid systems construct a discrete approximately-bisimilar abstraction of a continuous control system and apply automata-theoretic techniques to construct controllers enforcing given specifications. For the class of digital control systems (i.e., whose control signals are piecewise constant) satisfying incremental input-to-state stability (δ-ISS), existing techniques to compute discrete abstractions begin with a quantization of the state and input sets, and show that the quantized system is approximately bisimilar to the original if the sampling time is sufficiently large or if the Lyapunov functions of the system decrease fast enough. If the sampling time is not sufficiently large, the former technique fails to apply. While abstraction based on Lyapunov functions may be applicable, because of the conservative nature of Lyapunov functions in practice, the size of the discrete abstraction may be too large for subsequent analyses. In this paper, we propose a technique to compute discrete approximately-bisimilar abstractions of δ-ISS digital control systems. Our technique quantizes the state and input sets, but is based on multiple sampling steps: instead of requiring that the sampling time is sufficiently large (which may not hold), the abstract transition system relates states multiple sampling steps apart. We show on practical examples that the discrete state sets computed by our procedure can be several orders of magnitude smaller than existing approaches, and can compute symbolic approximate-bisimilar models even when other existing approaches do not apply or time-out. Since the size of the discrete state set is the main limiting factor in the application of symbolic control, our results enable symbolic control of larger systems than was possible before.