What Will Be Eventually True of Polynomial Hybrid Automata?
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Discrete-Time Refinement of Hybrid Automata
HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
Journal of Computer and System Sciences
Differential Dynamic Logic for Verifying Parametric Hybrid Systems
TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Computing Differential Invariants of Hybrid Systems as Fixedpoints
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Robust computations with dynamical systems
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Satisfiability of systems of equations of real analytic functions is quasi-decidable
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Differential dynamic logics: automated theorem proving for hybrid systems
Differential dynamic logics: automated theorem proving for hybrid systems
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Automatic rectangular refinement of affine hybrid systems
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Quantifying similarities between timed systems
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Safety verification of non-linear hybrid systems is quasi-semidecidable
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Taylor approximation for hybrid systems
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Safety verification of hybrid systems by constraint propagation based abstraction refinement
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
A robust interpretation of duration calculus
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Delta-Decidability over the Reals
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Computation with perturbed dynamical systems
Journal of Computer and System Sciences
Robust weighted timed automata and games
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
Safety verification of non-linear hybrid systems is quasi-decidable
Formal Methods in System Design
Hi-index | 0.06 |
Hybrid automata have been introduced in both control engineering and computer science as a formal model for the dynamics of hybrid discrete-continuous systems. In the case of so-called linear hybrid automata this formalization supports semi-decision procedures for state reachability, yet no decision procedures due to inherent undecidability [4]. Thus, unlike finite or timed automata, already linear hybrid automata are out-of-scope of fully automatic verification. In this article, we devise a new semi-decision method for safety of linear and polynomial hybrid systems which may only fail on pathological, practically uninteresting cases. These remaining cases are such that their safety depends on the complete absence of noise, a situation unlikely to occur in real hybrid systems. Furthermore, we show that if low probability effects of noise are ignored akin to the way they are suppressed in digital modelling then safety becomes fully decidable.