A New Class of Decidable Hybrid Systems

  • Gerardo Lafferriere
  • George J. Pappas
  • Sergio Yovine
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1569)

Abstract

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.

Keywords

Hybrid System Transition System Linear Vector Discrete Transition Discrete Location 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    R. Alur, C. Coucoubetis, N. Halbwachs, T.A. Henzinger, P.H. Ho, X. Nicolin, A. Olivero, J. Sifakis, and S. Yovine. The algorithmic analysis of hybrid systems. Theoretical Computer Science, 138:3–34, 1995.MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    R. Alur and D.L. Dill. A theory of timed automata. Theoretical Computer Science, 126:183–235, 1994.MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    D.S. Arnon, G.E. Collins, and S. McCallum. Cylindrical algebraic decomposition I: The basic algorithm. SIAM Journal on Computing, 13(4):865–877, November 1984.CrossRefMathSciNetGoogle Scholar
  4. 4.
    A. Dolzman and T. Sturm. REDLOG: Computer algebra meets computer logic. ACM SIGSAM Bulletin, 31(2): 2–9, June 1997.CrossRefGoogle Scholar
  5. 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. 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. 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. 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. 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. 10.
    A. Tarski. A decision method for elementary algebra and geometry. University of California Press, second edition, 1951.Google Scholar
  11. 11.
    C. Tomlin, G.J. Pappas, and S. Sastry. Conflict resolution for air traffic management: A study in multi-agent hybrid systems. IEEE Transactions on Automatic Control, 43(4):509–521, April 1998.MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    L. van den Dries. Tame Topology and o-minimal structures. Cambridge University Press, 1998.Google Scholar
  13. 13.
    L. van den Dries and C. Miller. On the real exponential field with restricted analytic functions. Israel Journal of Mathematics, 85:19–56, 1994.MATHMathSciNetCrossRefGoogle Scholar
  14. 14.
    P. Varaiya. Reach set computation using optimal control. 1997. preprint.Google Scholar
  15. 15.
    V. Weispfenning. A new approach to quantifier elimination for real algebra. Technical Report MIP-9305, Universität Passau, Germany, July 1993.Google Scholar
  16. 16.
    A. J. Wilkie. Model completeness results for expansions of the ordered field of real numbers by restricted pfaffian functions and the exponential function. Journal of the American Mathematical Society, 9(4):1051–1094, Oct 1996.MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Gerardo Lafferriere
    • 1
  • George J. Pappas
    • 2
  • Sergio Yovine
    • 3
  1. 1.Department of Mathematical SciencesPortland State UniversityPortland
  2. 2.Department of Electrical Engineering and Computer SciencesUniversity of California at BerkeleyBerkeley
  3. 3.VERIMAGCentre EquationGieresFrance

Personalised recommendations