Theoretical Computer Science
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Reachability analysis of dynamical systems having piecewise-constant derivatives
Theoretical Computer Science - Special issue on hybrid systems
What's decidable about hybrid automata?
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Deciding stability and mortality of piecewise affine dynamical systems
Theoretical Computer Science
Algorithmic analysis of polygonal hybrid systems, part I: Reachability
Theoretical Computer Science
Journal of Computer and System Sciences
Periodically Controlled Hybrid Systems
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
Verification of Periodically Controlled Hybrid Systems: Application to an Autonomous Vehicle
ACM Transactions on Embedded Computing Systems (TECS) - Special Section on CAPA'09, Special Section on WHS'09, and Special Section VCPSS' 09
On the decidability of stability of hybrid systems
Proceedings of the 16th international conference on Hybrid systems: computation and control
Hi-index | 0.00 |
The paper shows the decidability of the reachability problem for planar, monotonic, linear hybrid automata without resets. These automata are a special class of linear hybrid automata with only two variables, whose flows in all states is monotonic along some direction in the plane, and in which the continuous variables are not reset on a discrete transition.