Supervisory control of a class of discrete event processes
SIAM Journal on Control and Optimization
Qualitative modelling of linear dynamical systems with quantized state measurements
Automatica (Journal of IFAC)
&egr;-approximation of differential inclusions
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Hybrid Systems
Hybrid Systems II
Hybrid Systems IV
Hybrid Systems V
Hybrid System Modeling and Autonomous Control Systems
Hybrid Systems
Reachability Analysis via Face Lifting
HSCC '98 Proceedings of the First International Workshop on Hybrid Systems: Computation and Control
Hybrid Control Loops, A/D Maps, and Dynamic Specifications
HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
Discrete Dynamics of Two-Dimensional Nonlinear Hybrid Automata
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Rigorous discretization of hybrid systems using process calculi
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
An abstract model for proving safety of multi-lane traffic manoeuvres
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
Controller architecture for safe cognitive technical systems
SAFECOMP'07 Proceedings of the 26th international conference on Computer Safety, Reliability, and Security
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
Proving safety of traffic manoeuvres on country roads
Theories of Programming and Formal Methods
Hi-index | 0.00 |
The topic of this paper is the synthesis of discrete supervisory control for hybrid systems \Sigma with discrete external signals. Such systems are in general neither l-complete nor can they be represented by finite state machines. Our solution to the control problem is as follows: we find the strongest l-complete approximation (abstraction) \Sigma_l for \Sigma, represent it by a finite state machine, and investigate the control problem for the approximation. If a solution exists on the approximation level, we synthesize the maximally permissive supervisor for \Sigma_l. We show that it also solves the control problem for the underlying hybrid system \Sigma. If no solution exists, approximation accuracy can be increased by computing the strongest k-complete abstraction \Sigma_k, k l. The basic ideas regarding the approximation step are explained within the framework of Willems’ behavioral systems theory. Implementation issues are treated in a state space framework, and the main results are interpreted from a traditional control engineering point of view.