Theory of linear and integer programming
Theory of linear and integer programming
Supervisory control of a class of discrete event processes
SIAM Journal on Control and Optimization
What's decidable about hybrid automata?
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Automatic Symbolic Verification of Embedded Systems
IEEE Transactions on Software Engineering
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Symbolic Algorithms for Infinite-State Games
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Alternating-time Temporal Logic
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
PHAVer: algorithmic verification of hybrid systems past hytech
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Tracking differentiable trajectories across polyhedra boundaries
Proceedings of the 16th international conference on Hybrid systems: computation and control
| Hi-index | 0.00 |
We consider the problem of computing the controllable region of a Linear Hybrid Automaton with controllable and uncontrollable transitions, w.r.t. a reachability objective. We provide a semi-algorithm for the problem, by proposing the first algorithm in the literature for computing the set of states that must reach a given polyhedron while avoiding another one, subject to a polyhedral constraint on the slope of the trajectory. Experimental results are presented, based on an implementation of the proposed algorithm on top of the tool PHAVer.