Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Hybrid Systems: Computation and Control

HSCC 2004: Hybrid Systems: Computation and Control pp 402–416Cite as

Rigorous Modeling of Hybrid Systems Using Interval Arithmetic Constraints

  • Conference paper

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

Abstract

We provide a rigorous approach to modeling, simulating, and analyzing hybrid systems using CLP(F) (Constraint Logic Programming (Functions)) [14], a system which combines CLP (Constraint Language Programming) [21] with interval arithmetic [30]. We have implemented this system, and provide timing information. Because hybrid systems are often used to prove safety properties, it is critical to have a rigorous analysis. By using intervals throughout the system, we make it easier to include measurement errors in our models and to prove safety properties.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  MATH  MathSciNet  Google Scholar 

  2. Benhamou, F., Older, W.J.: Applying interval arithmetic to real, integer, and boolean constraints. Journal of Logic Programming 32(1), 1–24 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  3. Clark, K.: Negation as failure. In: Gallaire, H., Minker, J. (eds.) Logic and Databases, pp. 293–322. Plenum Press, New York (1978)

    Google Scholar 

  4. Davoren, J., Nerode, A.: Logics for hybrid systems. Proceedings of the IEEE 88(7), 985–1010 (2000)

    Article  Google Scholar 

  5. Debray, S., Hickey, T.J.: Constraint-based termination analysis for cyclic rule activation in active databases. In: Proceedings of DOOD 2000: Sixth International Conference on Rules and Objects in Databases. LNCS (LNAI), vol. 1861, pp. 1121–1136. Springer, Heidelberg (2000)

    Google Scholar 

  6. Delzanno, G., Podelski, A.: Model checking in CLP. In: Cleaveland, R. (ed.) TACAS 1999. LNCS, vol. 1579, pp. 223–239. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  7. Delzanno, G., Podelski, A.: Constraint-based deductive model checking. International Journal on Software Tools for Technology Transfer (STTT) 3(3) (2001)

    Google Scholar 

  8. Edalat, A., Heckmann, R.: Computing with real numbers (i)LFT approach to real computation (ii) domain-theoretic model of computational geometry. In: Barthe, G., Dybjer, P., Pinto, L., Saraiva, J. (eds.) APPSEM 2000. LNCS, vol. 2395, Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  9. Gupta, V., Jagadeesan, R., Saraswat, V.: Hybrid cc, hybrid automata and program verification. In: Alur, R., Henzinger, T.A., Sontag, E.D. (eds.) HS 1995. LNCS, vol. 1066, pp. 52–63. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  10. Gupta, V., Jagadeesan, R., Saraswat, V., Bobrow, D.G.: Programming in hybrid constraint languages. In: Antsaklis, P., Kohn, W., Nerode, A., Sastry, S. (eds.) HS 1994. LNCS, vol. 999, pp. 226–251. Springer, Heidelberg (1995)

    Google Scholar 

  11. Henzinger, T.A.: The theory of hybrid automata. In: Proceedings, 11th Symposium on Logic in Computer Science (LICS 1996), pp. 278–292. IEEE Computer Society Press, Los Alamitos (1996)

    Chapter  Google Scholar 

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

    Article  MATH  Google Scholar 

  13. Henzinger, T.A., Horowitz, B., Majumdar, R., Wong-Toi, H.: Beyond HYTECH: Hybrid systems analyis using interval numerical methods. In: Lynch, N., Krogh, B.H. (eds.) HSCC 2000. LNCS, vol. 1790, pp. 130–144. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  14. Hickey, T.J.: Analytic constraint solving and interval arithmetic. In: POPL 2000 ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 338–351 (2000) (published as vol. 27 of SIGPLAN notices)

    Google Scholar 

  15. Hickey, T.J.: Metalevel interval arithmetic and verifiable constraint solving. Journal of Functional and Logic Programming, 2001(7) (October 2001), http://danae.uni-muenster.de/lehre/kuchen/JFLP/articles/2001/S01-02/JFLP-A01-07.pdf

  16. Hickey, T.J., Cohen, J.: Automating program analysis. JACM 35(1), 185–220 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  17. Hickey, T.J., Ju, Q., van Emden, M.H.: Interval arithmetic: from principles to implementation. JACM 48(5), 1038–1068 (2001)

    Article  Google Scholar 

  18. Holzbaur, C.: OFAI CLP(Q,R) Manual. Austrian Research Institute for Artificial Intelligence, Vienna, 1.3.3 edn, TR-95-05 (1995)

    Google Scholar 

  19. IEEE: IEEE standard 754-1985 for binary floating-point arithmetic. SIGPLAN 22(2), 9–25 (1985)

    Google Scholar 

  20. Jaffar, J., Lassez, J.: Constraint logic programming. In: Proceedings 14th ACM Symposium on the Principles of Programming Languages, pp. 111–119 (1987)

    Google Scholar 

  21. Jaffar, J., Maher, M.J.: Constraint logic programming: A survey. Journal of. Logic Programming 19/20, 503–581 (1994)

    Article  MathSciNet  Google Scholar 

  22. Kahan, W.: Lecture notes on the status of IEEE standard 754 for binary floatingpoint arithmetic. Technical report, EECS, University of California, Berkeley (1996)

    Google Scholar 

  23. Kowalewski, S., Stursberg, O., Fritz, M., Graf, H., Hoffman, I., Preußig, J., Remelhe, M., Simon, S., Treseler, H.: A case study in tool-aided analysis of discretely controlled continuous systems: The two tanks problem. In: Antsaklis, P., Kohn, W., Lemmon, M., Nerode, A., Sastry, S. (eds.) HS 1997. LNCS, vol. 1567, pp. 163–185. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  24. Kuipers, B.J.: Qualitative simulation: Then and now. Artificial Intelligence 59, 133–140 (1993)

    Article  Google Scholar 

  25. Lloyd, J.W.: Foundations of Logic Programming. expanded edn. Springer, Heidelberg (1987)

    MATH  Google Scholar 

  26. Lynch, N., Segala, R., Vaandrager, F.: Hybrid I/O automata revisited. In: Benedetto, M.D.D., Sangiovanni-Vincentelli, A. (eds.) HSCC 2001. LNCS, vol. 2034, pp. 403–417. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  27. Lynch, N., Segala, R., Vaandrager, F.W., Weinberg, H.: Hybrid I/O automata. Technical Report CSI-R9907, Computing Science Institue Nijmegen; Faculty of Mathematics and Informatics; Catholic University of Nijmegen, Toernooivveld 1; 6525 ED Nijmegen; The Netherlands (April 1999)

    Google Scholar 

  28. Maler, O., Manna, Z., Pnueli, A.: From timed to hybrid systems. In: de Bakker, J., Huizing, C., de Roever, W., Rozenberg, G. (eds.) REX 1991. LNCS, vol. 600, pp. 447–484. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  29. Markov, S., Angelov, R.: An interval method for systems of ODE. In: Nickel, K. (ed.) Interval Mathematics 1985. LNCS, vol. 212, pp. 103–108. Springer, Heidelberg (1985)

    Google Scholar 

  30. Moore, R.E.: Interval Analysis. Prentice-Hall, Englewood Cliffs (1966)

    MATH  Google Scholar 

  31. Shankar, A.U.: An introduction to assertional reasoning for concurrent systems. ACM Computing Surveys 25(3), 225–262 (1993)

    Article  Google Scholar 

  32. Smith, D.A., Hickey, T.J.: Partial evaluation of a CLP language. In: Debray, S., Hermenegildo, M. (eds.) Proceedings of the 1990 North American Conference in Logic Programming, pp. 119–138 (1990)

    Google Scholar 

  33. Stursberg, O., Kowalewski, S., Hoffman, I., Preußig, J.: Comparing timed and hybrid automata as approximations of continuous systems. In: Antsaklis, P., Kohn, W., Nerode, A., Sastry, S. (eds.) HS 1996. LNCS, vol. 1273, pp. 361–377. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  34. Urbina, L.: Analysis of hybrid systems in CLP(R). In: Freuder, E.C. (ed.) CP 1996. LNCS, vol. 1118, pp. 451–467. Springer, Heidelberg (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Brandeis University,  

    Timothy J. Hickey & David K. Wittenberg

Authors
  1. Timothy J. Hickey
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. David K. Wittenberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Pennsylvania,  

    Rajeev Alur

  2. School of Engineering and Applied Science, University of Pennsylvania,  

    George J. Pappas

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hickey, T.J., Wittenberg, D.K. (2004). Rigorous Modeling of Hybrid Systems Using Interval Arithmetic Constraints. In: Alur, R., Pappas, G.J. (eds) Hybrid Systems: Computation and Control. HSCC 2004. Lecture Notes in Computer Science, vol 2993. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24743-2_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24743-2_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21259-1

  • Online ISBN: 978-3-540-24743-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation