Verification of Real-Time Systems using Linear Relation Analysis
Formal Methods in System Design - Special issue on computer aided verification (CAV 93)
Automatic Symbolic Verification of Embedded Systems
IEEE Transactions on Software Engineering
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Not necessarily closed convex polyhedra and the double description method
Formal Aspects of Computing
Combining control and data abstraction in the verification of hybrid systems
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems - Special section on the ACM IEEE international conference on formal methods and models for codesign (MEMOCODE) 2009
Reachability games for linear hybrid systems
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
| Hi-index | 0.00 |
We analyze the properties of differentiable trajectories subject to a constant differential inclusion which constrains the first derivative to belong to a given convex polyhedron. We present the first exact algorithm that computes the set of points from which there is a trajectory that reaches a given polyhedron while avoiding another (possibly non-convex) polyhedron. We discuss the connection with (Linear) Hybrid Automata and in particular the relationship with the classical algorithm for reachability analysis for Linear Hybrid Automata.