The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Information and Computation
Compositional Quantitative Reasoning
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Safety verification of hybrid systems by constraint propagation-based abstraction refinement
ACM Transactions on Embedded Computing Systems (TECS)
PHAVer: algorithmic verification of hybrid systems past HyTech
International Journal on Software Tools for Technology Transfer (STTT)
Contract-Based Design for Computation and Verification of a Closed-Loop Hybrid System
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
KeYmaera: A Hybrid Theorem Prover for Hybrid Systems (System Description)
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
SpaceEx: scalable verification of hybrid systems
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Quantitative refinement for weighted modal transition systems
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Semantics and Computability of the Evolution of Hybrid Systems
SIAM Journal on Control and Optimization
| Hi-index | 0.00 |
When designing embedded systems, often the need arises to model systems having a mixed discrete and continuous behavior. Such hybrid systems commonly consist of a discrete control part that operates in a continuous environment and may be represented by hybrid automata. We recently proposed an open-source framework for hybrid automata analysis, called Ariadne, which exploits approximation techniques based on the theory of computable analysis. In this paper we will show how the approximation capabilities of Ariadne can be used to verify nonlinear hybrid automata inside a design space by means of reachability analysis. In particular, we will use the tool to solve a problem of dominance checking.