International Conference on Formal Engineering Methods

Formal Methods and Software Engineering pp 319-335 | Cite as

Enhanced Distributed Behavioral Cartography of Parametric Timed Automata

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9407)

Abstract

Parametric timed automata (PTA) allow the specification and verification of timed systems incompletely specified, or subject to future changes. The behavioral cartography splits the parameter space of PTA in tiles in which the discrete behavior is uniform. Applications include the optimization of timing constants, and the measure of the system robustness w.r.t. the untimed language. Here, we present enhanced distributed algorithms to compute the cartography efficiently. Experimental results show that our new algorithms significantly outperform previous distribution techniques.

References

  1. 1.
    Alur, R., Henzinger, T. A., Vardi, M.Y.: Parametric real-time reasoning. In: STOC, pp. 592–601. ACM (1993)Google Scholar
  2. 2.
    André, É., Coti, C., Evangelista, S.: Distributed behavioral cartography of timed automata. In: EuroMPI/ASIA, pp. 109–114. ACM (2014)Google Scholar
  3. 3.
    André, É., Fribourg, L.: Behavioral cartography of timed automata. In: Kučera, A., Potapov, I. (eds.) RP 2010. LNCS, vol. 6227, pp. 76–90. Springer, Heidelberg (2010) CrossRefGoogle Scholar
  4. 4.
    André, É., Fribourg, L., Kühne, U., Soulat, R.: IMITATOR 2.5: a tool for analyzing robustness in scheduling problems. In: Giannakopoulou, D., Méry, D. (eds.) FM 2012. LNCS, vol. 7436, pp. 33–36. Springer, Heidelberg (2012) CrossRefGoogle Scholar
  5. 5.
    André, É., Lipari, G., Nguyen, H.G., Sun, Y.: Reachability preservation based parameter synthesis for timed automata. In: Havelund, K., Holzmann, G., Joshi, R. (eds.) NFM 2015. LNCS, vol. 9058, pp. 50–65. Springer, Heidelberg (2015) Google Scholar
  6. 6.
    André, É., Markey, N.: Language preservation problems in parametric timed automata. In: Sankaranarayanan, S., Vicario, E. (eds.) FORMATS 2015. LNCS, vol. 9268, pp. 27–43. Springer, Heidelberg (2015) CrossRefGoogle Scholar
  7. 7.
    André, É., Soulat, R.: The Inverse Method. ISTE Ltd and Wiley & Sons, London, UK (2013)Google Scholar
  8. 8.
    Annichini, A., Bouajjani, A., Sighireanu, M.: TREX: a tool for reachability analysis of complex systems. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 368–372. Springer, Heidelberg (2001) CrossRefGoogle Scholar
  9. 9.
    Cimatti, A., Griggio, A., Mover, S., Tonetta, S.: Parameter synthesis with IC3. In: FMCAD, pp. 165–168. IEEE (2013)Google Scholar
  10. 10.
    De Wulf, M., Doyen, L., Raskin, J.: Almost ASAP semantics: from timed models to timed implementations. Formal Aspects Comput. 17(3), 319–341 (2005)CrossRefMATHGoogle Scholar
  11. 11.
    Evangelista, S., Laarman, A., Petrucci, L., van de Pol, J.: Improved multi-core nested depth-first search. In: Chakraborty, S., Mukund, M. (eds.) ATVA 2012. LNCS, vol. 7561, pp. 269–283. Springer, Heidelberg (2012) CrossRefGoogle Scholar
  12. 12.
    Hamidouche, K., Borghi, A., Esterie, P., Falcou, J., Peyronnet, S.: Three high performance architectures in the parallel APMC boat. In: PMDC. IEEE (2010)Google Scholar
  13. 13.
    Jovanović, A., Lime, D., Roux, O.H.: Integer parameter synthesis for timed automata. IEEE Trans. Softw.Eng. 41(5), 445–461 (2015)CrossRefMATHGoogle Scholar
  14. 14.
    Kahsai, T., Tinelli, C.: PKind: a parallel \(k\)-induction based model checker. In: PDMC, vol. 72, pp. 55–62 (2011)Google Scholar
  15. 15.
    Laarman, A., Olesen, M.C., Dalsgaard, A.E., Larsen, K.G., van de Pol, J.: Multi-core emptiness checking of timed Büchi automata using inclusion abstraction. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 968–983. Springer, Heidelberg (2013) CrossRefGoogle Scholar
  16. 16.
    Larsen, K.G., Pettersson, P., Yi, W.: UPPAAL in a nutshell. Int. J. Softw. Tools Technol. Transf. 1(1–2), 134–152 (1997)CrossRefMATHGoogle Scholar
  17. 17.
    Markey, N.: Robustness in real-time systems. In: SIES, pp. 28–34. IEEE Computer Society Press (2011)Google Scholar
  18. 18.
    Sun, J., Liu, Y., Dong, J.S., Pang, J.: PAT: towards flexible verification under fairness. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 709–714. Springer, Heidelberg (2009) CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Étienne André
    • 1
  • Camille Coti
    • 1
  • Hoang Gia Nguyen
    • 1
  1. 1.Université Paris 13, Sorbonne Paris Cité, LIPN, CNRS, UMR 7030VilletaneuseFrance

Personalised recommendations