A New Class of Decidable Hybrid Systems
One of the most important analysis problems of hybrid systems is the reachability problem. State of the art computational tools perform reachability computation for timed automata, multirate automata, and rectangular automata. In this paper, we extend the decidability frontier for classes of linear hybrid systems, which are introduced as hybrid systems with linear vector fields in each discrete location. This result is achieved by showing that any such hybrid system admits a finite bisimulation, and by providing an algorithm that computes it using decision methods from mathematical logic.
KeywordsHybrid System Transition System Linear Vector Discrete Transition Discrete Location
Unable to display preview. Download preview PDF.
- 5.T.A. Henzinger. Hybrid automata with finite bisimulations. In Z. Fülöp and F. Gécseg, editors, ICALP 95: Automata, Languages, and Programming, pages 324–335. Springer-Verlag, 1995.Google Scholar
- 6.T.A. Henzinger, P.W. Kopke, A. Puri, and P. Varaiya. What’s decidable about hybrid automata? In Proceedings of the 27th Annual Symposium on Theory of Computing, pages 373–382. ACM Press, 1995.Google Scholar
- 7.G. Lafferriere, G.J. Pappas, and S. Sastry. O-minimal hybrid systems. Technical Report UCB/ERL M98/29, University of California at Berkeley, Berkeley, CA, April 1998.Google Scholar
- 8.G. Lafferriere, G.J. Pappas, and S. Yovine. Reachability computation of linear hybrid systems. In Proc. of 14th IFAC World Congress. Elsevier Science Ltd., 1999. To appear.Google Scholar
- 9.A. Puri and P. Varaiya. Decidability of hybrid systems with rectangular differential inclusions. In Computer Aided Verification, pages 95–104, 1994.Google Scholar
- 10.A. Tarski. A decision method for elementary algebra and geometry. University of California Press, second edition, 1951.Google Scholar
- 12.L. van den Dries. Tame Topology and o-minimal structures. Cambridge University Press, 1998.Google Scholar
- 14.P. Varaiya. Reach set computation using optimal control. 1997. preprint.Google Scholar
- 15.V. Weispfenning. A new approach to quantifier elimination for real algebra. Technical Report MIP-9305, Universität Passau, Germany, July 1993.Google Scholar