The analysis, verification, and control of hybrid automata with finite bisimulations can be reduced to finite-state problems. We advocate a time-abstract, phase-based methodology for checking if a given hybrid automaton has a finite bisimulation. First, we factor the automaton into two components, a boolean automaton with a discrete dynamics on the finite state space B m and a euclidean automaton with a continuous dynamics on the infinite state space n . Second, we investigate the phase portrait of the euclidean component. In this fashion, we obtain new decidability results for hybrid systems as well as new, uniform proofs of known decidability results.
This research was supported in part by the NSF grant CCR-9200794, by the AFOSR contract F49620-93-1-0056, and by the DARPA grant NAG2-892.
324 - 335
ICALP: Automata, Languages and Programming
Henzinger TA. Hybrid automata with finite bisimulations. In: Vol 944. Springer; 1995:324-335. doi:0.1007/3-540-60084-1_85
Henzinger, T. A. (1995). Hybrid automata with finite bisimulations (Vol. 944, pp. 324–335). Presented at the ICALP: Automata, Languages and Programming, Springer. https://doi.org/0.1007/3-540-60084-1_85
Henzinger, Thomas A. “Hybrid Automata with Finite Bisimulations,” 944:324–35. Springer, 1995. https://doi.org/0.1007/3-540-60084-1_85.
T. A. Henzinger, “Hybrid automata with finite bisimulations,” presented at the ICALP: Automata, Languages and Programming, 1995, vol. 944, pp. 324–335.
Henzinger TA. 1995. Hybrid automata with finite bisimulations. ICALP: Automata, Languages and Programming, LNCS, vol. 944, 324–335.
Henzinger, Thomas A. Hybrid Automata with Finite Bisimulations. Vol. 944, Springer, 1995, pp. 324–35, doi:0.1007/3-540-60084-1_85.