Skip to main content
SpringerLink
Log in
Book cover

International Conference on Formal Modeling and Analysis of Timed Systems

FORMATS 2021: Formal Modeling and Analysis of Timed Systems pp 84–99Cite as

An Integer Static Analysis for Better Extrapolation in Uppaal

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12860))

Abstract

Extended Timed Automata (XTA) is a widely used formalism to show the correctness of industrial applications. The decidability results and current extrapolations for XTA are based on constants in the automaton. However, in the case of XTA such bounds depend on integer variables or variable expressions. Since computing such bounds can be as expensive as the verification task, tools such as Uppaal over-approximate the bounds by values given in the type definitions. These values are excessively large and can yield huge state spaces. In this paper we outline a targeted static analysis to efficiently over-approximate location based invariants (and thereby ranges) of integer variables. We have implemented our analysis in Uppaal where the new tighter bounds are available to all currently implemented extrapolation operations. Our experiments show an exponential reduction in the state space of several models. In addition, the computation overhead introduced by the integer static analysis is negligible.

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   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

References

  1. Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183–235 (1994)

    Article  MathSciNet  Google Scholar 

  2. Behrmann, G., David, A., Larsen, K.G.: A tutorial on Uppaal. In: Bernardo, M., Corradini, F. (eds.) SFM-RT 2004. LNCS, vol. 3185, pp. 200–236. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-30080-9_7

    Chapter  Google Scholar 

  3. Feo-Arenis, S., Westphal, B., Dietsch, D., Muñiz, M., Andisha, S., Podelski, A.: Ready for testing: ensuring conformance to industrial standards through formal verification. Formal Aspects Comput. 28(3), 499–527 (2016). https://doi.org/10.1007/s00165-016-0365-3

    Article  MathSciNet  Google Scholar 

  4. Havelund, K., Skou, A., Larsen, K.G., Lund, K.: Formal modeling and analysis of an audio/video protocol: an industrial case study using UPPAAL. In: Proceedings Real-Time Systems Symposium, pp. 2–13 (1997). https://doi.org/10.1109/REAL.1997.641264

  5. Bengtsson, J., Yi, W.: On clock difference constraints and termination in reachability analysis of timed automata. In: Dong, J.S., Woodcock, J. (eds.) ICFEM 2003. LNCS, vol. 2885, pp. 491–503. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-39893-6_28

    Chapter  Google Scholar 

  6. Behrmann, G., Bouyer, P., Fleury, E., Larsen, K.G.: Static guard analysis in timed automata verification. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 254–270. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-36577-X_18

    Chapter  MATH  Google Scholar 

  7. Behrmann, G., Bouyer, P., Larsen, K.G., Pelánek, R.: Lower and upper bounds in zone-based abstractions of timed automata. Int. J. Softw. Tools Technol. Transf. 8(3), 204–215 (2006). https://doi.org/10.1007/s10009-005-0190-0. ISSN: 1433–2787

    Article  MATH  Google Scholar 

  8. Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Proceedings of the 4th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, POPL 1977, pp. 238–252. Association for Computing Machinery, Los Angeles (1977). ISBN: 9781450373500. https://doi.org/10.1145/512950.512973

  9. Herbreteau, F., Srivathsan, B., Walukiewicz, I.: Better abstractions for timed automata. In: 2012 27th Annual IEEE Symposium on Logic in Computer Science, pp. 375–384 (2012). https://doi.org/10.1109/LICS.2012.48

  10. Halbwachs, N., Proy, Y.-E., Roumanosff, P.: Verification of real-time systems using linear relation analysis. Formal Methods Syst. Des. 11, 157–185 (1997). https://doi.org/10.1023/A:1008678014487

    Article  Google Scholar 

  11. Larsen, K.G., Mikučionis, M., Muñiz, M., Srba, J.: Urgent partial order reduction for extended timed automata. In: Hung, D.V., Sokolsky, O. (eds.) ATVA 2020. LNCS, vol. 12302, pp. 179–195. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-59152-6_10 ISBN: 978-3-030-59152-6

    Chapter  Google Scholar 

  12. Wies, T.: Symbolic shape analysis. PhD thesis. University of Freiburg (2009). http://www.freidok.uni-freiburg.de/volltexte/6972/

  13. Cousot, P., Cousot, R.: Constructive versions of tarski’s fixed point theorems. English (US). Pac. J. Math. 82(1), 43–57 (1979). https://doi.org/10.2140/pjm.1979.82.43. ISSN: 0030–8730

    Article  MATH  Google Scholar 

  14. Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: Proceedings of the 5th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pp. 84–96 (1978)

    Google Scholar 

  15. Bagnara, R., Hill, P.M., Ricci, E., Zaffanella, E.: Precise widening operators for convex polyhedra. Sci. Comput. Program. 58(1–2), 28–56 (2005)

    Article  MathSciNet  Google Scholar 

  16. Saini, S., Fehnker, A.: Evaluating the stream control transmission protocol using uppaal. In: Electronic Proceedings in Theoretical Computer Science, vol. 244, March 2017, pp. 1–13. https://doi.org/10.4204/eptcs.244.1

  17. Paxson, V., Allman, M., Chu, J., Sargent, M.: Computing TCP’s retransmission timer. Technical report rfc 2988, November (2000)

    Google Scholar 

  18. Bagnara, R., Hill, P.M., Zaffanella, E.: The Parma polyhedra library: toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems. Sci. Comput. Program. 72(1), 3–21 (2008). https://doi.org/10.1016/j.scico.2007.08.001. http://www.sciencedirect.com/science/article/pii/S0167642308000415. Special Issue on Second issue of experimental software and toolkits (EST). ISSN: 0167–6423

    Article  MathSciNet  Google Scholar 

  19. Steiner, W., Elmenreich, W.: Automatic Recovery of the TTP/A Sensor/Actuator Network, October 2003

    Google Scholar 

  20. Godary, K.: Validation temporelle de réseaux embarqués critiques etfiables pour l’automobile. PhD thesis. Institut National des Sciences Appliquées de Lyon (2005)

    Google Scholar 

  21. Bouyer, P., Colange, M., Markey, N.: Symbolic optimal reachability in weighted timed automata. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016, Part I. LNCS, vol. 9779, pp. 513–530. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-41528-4_28 ISBN: 978-3-319-41528-4

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Aalborg University, Aalborg, Denmark

    Sebastian Lund, Jesper van Diepen, Kim G. Larsen, Marco Muñiz, Tobias Ringholm Jørgensen & Tobias Skaarup Daa Andersen

Authors
  1. Sebastian Lund
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jesper van Diepen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kim G. Larsen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Marco Muñiz
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Tobias Ringholm Jørgensen
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Tobias Skaarup Daa Andersen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marco Muñiz .

Editor information

Editors and Affiliations

  1. Université Paris-Est Créteil, Créteil, France

    Catalin Dima

  2. CNRS, Université de Paris, Paris, France

    Mahsa Shirmohammadi

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Lund, S., van Diepen, J., Larsen, K.G., Muñiz, M., Jørgensen, T.R., Andersen, T.S.D. (2021). An Integer Static Analysis for Better Extrapolation in Uppaal. In: Dima, C., Shirmohammadi, M. (eds) Formal Modeling and Analysis of Timed Systems. FORMATS 2021. Lecture Notes in Computer Science(), vol 12860. Springer, Cham. https://doi.org/10.1007/978-3-030-85037-1_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-85037-1_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-85036-4

  • Online ISBN: 978-3-030-85037-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation