The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Predicate abstraction for reachability analysis of hybrid systems
ACM Transactions on Embedded Computing Systems (TECS)
Hi-index | 0.00 |
In this paper we present a formalization of the theory of hybrid automata and algorithms for building trajectory trees using module types and functors in the Coqproof assistant.