Nothing Special   »   [go: up one dir, main page]

Skip to main content

An algorithm for the approximative analysis of rectangular automata

  • Selected Presentations
  • Conference paper
  • First Online:
Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1486))

Abstract

Rectangular automata are well suited for approximate modeling of continuous-discrete systems. The exact analysis of these automata is feasible for small examples but can encounter severe numerical problems for even medium-sized systems. This paper presents an analysis algorithm that uses conservative overapproximation to avoid these numerical problems. The algorithm is demonstrated on a simple benchmark system consisting of two connected tanks.

Supported by the German Research Council (DFG) under grant Ko1430/3 in the special program KONDISK (‘Continuous-discrete dynamics of technical systems’).

This research was supported in part by the ONR YIP award N00014-95-1-0520, by the NSF CAREER award CCR-9501708, by the NSF grant CCR-9504469, by the DARPA/NASA grant NAG2-1214, by the ARO MURI grant DAAH-04-96-1-0341, and by the SRC contract 97-DC-324.041.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Alur, C. Courcoubetis, N. Halbwachs, T.A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine. The algorithmic analysis of hybrid systems. Theoretical Computer Science, 138:3–34, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  2. P. Antsaklis, A. Nerode, W. Kohn, and S. Sastry, editors. Hybrid Systems IV. Lecture Notes in Computer Science 1273. Springer-Verlag, 1997.

    Google Scholar 

  3. T. Dang and O. Maler. Reachability analysis via face lifting. In T.A. Henzinger and S. Sastry, editors, HSCC 98: Hybrid Systems—Computation and Control, Lecture Notes in Computer Science 1386, pages 96–109. Springer-Verlag, 1998.

    Google Scholar 

  4. M.R. Greenstreet. Verifying safety properties of differential equations. In R. Alur and T.A. Henzinger, editors, CAV 96: Computer Aided Verification, Lecture Notes in Computer Science 1102, pages 277–287. Springer-Verlag, 1996.

    Google Scholar 

  5. M.R. Greenstreet and I. Mitchell. Integrating projections. In T.A. Henzinger and S. Sastry, editors, HSCC 98: Hybrid Systems—Computation and Control, Lecture Notes in Computer Science 1386, pages 159–174. Springer-Verlag, 1998.

    Google Scholar 

  6. N. Halbwachs, P. Raymond, and Y.-E. Proy. Verification of linear hybrid systems by means of convex approximation. In B. LeCharlier, editor, SAS 94: Static Analysis Symposium, Lecture Notes in Computer Science 864, pages 223–237. Springer-Verlag, 1994.

    Google Scholar 

  7. T.A. Henzinger, P.-H. Ho, and H. Wong-Toi. Algorithmic analysis of nonlinear hybrid systems. IEEE Transactions on Automatic Control, 43(4):540–554, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  8. T.A. Henzinger, P.H. Ho, and H. Wong-Toi. HyTech: A model checker for hybrid systems. Software Tools for Technology Transfer, 1(1,2):110–122, 1997.

    Article  MATH  Google Scholar 

  9. 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. Pull version to appear in Journal of Computer and System Sciences.

    Google Scholar 

  10. T.A. Henzinger and S. Sastry, editors. HSCC 98: Hybrid Systems—Computation and Control Lecture Notes in Computer Science 1386. Springer-Verlag, 1998.

    Google Scholar 

  11. T. Stauner, O. Müller, and M. Fuchs. Using HyTech to verify an automotive control system. In O. Maler, editor, HART 97: Hybrid and Real-Time Systems, Lecture Notes in Computer Science 1201, pages 139–153. Springer-Verlag, 1997.

    Google Scholar 

  12. O. Stursberg, S. Kowalewski, I. Hoffmann, and J. Preu\ig. Comparing timed and hybrid automata as approximations of continuous systems. In P. Antsaklis, W. Kohn, A. Nerode, and S. Sastry, editors, Hybrid Systems IV, Lecture Notes in Computer Science 1273, pages 361–377. Springer-Verlag, 1996.

    Google Scholar 

  13. T. Villa, H. Wong-Toi, A. Balluchi, J. Preu\ig, A. Sangiovanni-Vincentelli, and Y. Watanabe. Formal verification of an automotive engine controller in cutoff mode. 1998. Submitted.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Anders P. Ravn Hans Rischel

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Preu\ig, J., Kowalewski, S., Wong-Toi, H., Henzinger, T.A. (1998). An algorithm for the approximative analysis of rectangular automata. In: Ravn, A.P., Rischel, H. (eds) Formal Techniques in Real-Time and Fault-Tolerant Systems. FTRTFT 1998. Lecture Notes in Computer Science, vol 1486. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055350

Download citation

  • DOI: https://doi.org/10.1007/BFb0055350

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65003-4

  • Online ISBN: 978-3-540-49792-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics