Enhancing the Inverse Method with State Merging

  • Étienne André
  • Laurent Fribourg
  • Romain Soulat
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7226)

Abstract

Keeping the state space small is essential when verifying real-time systems using Timed Automata (TA). In the model-checker Uppaal, the merging operation has been used extensively in order to reduce the number of states. Actually, Uppaal’s merging technique applies within the more general setting of Parametric Timed Automata (PTA). The Inverse Method (IM) for a PTA \(\mathcal{A}\) is a procedure that synthesizes a zone around a given point π0 (parameter valuation) over which \(\mathcal{A}\) is guaranteed to behave in an equivalent time-abstract manner. We show that the integration of merging into IM leads to the synthesis of larger zones around π0. It also often improves the performance of IM, both in terms of computational space and time, as shown by our experimental results.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abdeddaïm, Y., Maler, O.: Job-Shop Scheduling Using Timed Automata. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 478–492. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  2. 2.
    André, É., Chatain, T., Encrenaz, E., Fribourg, L.: An inverse method for parametric timed automata. IJFCS 20(5), 819–836 (2009)MATHGoogle Scholar
  3. 3.
    André, É., Soulat, R.: Synthesis of Timing Parameters Satisfying Safety Properties. In: Delzanno, G., Potapov, I. (eds.) RP 2011. LNCS, vol. 6945, pp. 31–44. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  4. 4.
    André, É.: IMITATOR II: A tool for solving the good parameters problem in timed automata. In: INFINITY, pp. 91–99 (2010)Google Scholar
  5. 5.
    André, É.: An Inverse Method for the Synthesis of Timing Parameters in Concurrent Systems. Thèse de doctorat, ENS Cachan, France (2010)Google Scholar
  6. 6.
    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. Science of Computer Programming 72(1–2), 3–21 (2008)MathSciNetCrossRefGoogle Scholar
  7. 7.
    David, A.: Merging DBMs efficiently. In: 17th Nordic Workshop on Programming Theory, pp. 54–56. DIKU, University of Copenhagen (2005)Google Scholar
  8. 8.
    David, A.: Uppaal DBM Library Programmer’s Reference (2006), http://people.cs.aau.dk/~adavid/UDBM/manual-061023.pdf
  9. 9.
    Henzinger, T.A., Ho, P.H., Wong-Toi, H.: A user guide to HyTech. In: Brinksma, E., Steffen, B., Cleaveland, W.R., Larsen, K.G., Margaria, T. (eds.) TACAS 1995. LNCS, vol. 1019, pp. 41–71. Springer, Heidelberg (1995)CrossRefGoogle Scholar
  10. 10.
    Markey, N.: Robustness in real-time systems. In: SIES 2011, Sweden, pp. 28–34. IEEE Computer Society Press (2011)Google Scholar
  11. 11.
    Salah, R.B., Bozga, M., Maler, O.: On Interleaving in Timed Automata. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 465–476. Springer, Heidelberg (2006)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Étienne André
    • 1
  • Laurent Fribourg
    • 2
  • Romain Soulat
    • 2
  1. 1.LIPNCNRS UMR 7030, Université Paris 13France
  2. 2.LSVENS Cachan & CNRSFrance

Personalised recommendations