Skip to main content
SpringerLink
Log in

A Benchmarks Library for Extended Parametric Timed Automata

  • Conference paper
  • First Online:
Book cover Tests and Proofs (TAP 2021)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 12740))

Included in the following conference series:

Abstract

Parametric timed automata are a powerful formalism for reasoning on concurrent real-time systems with unknown or uncertain timing constants. In order to test the efficiency of new algorithms, a fair set of benchmarks is required. We present an extension of the IMITATOR benchmarks library, that accumulated over the years a number of case studies from academic and industrial contexts. We extend here the library with several dozens of new benchmarks; these benchmarks highlight several new features: liveness properties, extensions of (parametric) timed automata (including stopwatches or multi-rate clocks), and unsolvable toy benchmarks. These latter additions help to emphasize the limits of state-of-the-art parameter synthesis techniques, with the hope to develop new dedicated algorithms in the future.

This work is partially supported by the ANR-NRF French-Singaporean research program ProMiS (ANR-19-CE25-0015).

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

Access this chapter

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

Institutional subscriptions

Notes

  1. 1.

    While many keywords remain the same in the model, the property syntax has been completely rewritten, and the model checker now takes as input a model file and a property file. In addition, new properties are now possible, and the syntax has been extended with some useful features such as multi-rate clocks.

  2. 2.

    A subclass of PTAs where the set of parameters is partitioned into “lower-bound” and “upper-bound” parameters [37]. L/U-PTAs enjoy nicer decidability properties.

References

  1. JANI specification (2017). https://jani-spec.org/

  2. The IMITATOR benchmarks library v1.0 (2018). https://www.imitator.fr/library1.html

  3. ARCH benchmarks (2021). https://cps-vo.org/group/ARCH/benchmarks

  4. MARS repository (2021). http://www.mars-workshop.org/repository.html

  5. Model checking contest (2021). https://mcc.lip6.fr/

  6. The IMITATOR benchmarks library v2.0 (2021). https://www.imitator.fr/static/library2/

  7. Aceto, L., Bouyer, P., Burgueño, A., Larsen, K.G.: The power of reachability testing for timed automata. TCS 300(1–3), 411–475 (2003). https://doi.org/10.1016/S0304-3975(02)00334-1

  8. Alur, R., et al.: The algorithmic analysis of hybrid systems. TCS 138(1), 3–34 (1995). https://doi.org/10.1016/0304-3975(94)00202-T

  9. Alur, R., Courcoubetis, C., Henzinger, T.A., Ho, P.-H.: Hybrid automata: an algorithmic approach to the specification and verification of hybrid systems. In: Grossman, R.L., Nerode, A., Ravn, A.P., Rischel, H. (eds.) HS 1991-1992. LNCS, vol. 736, pp. 209–229. Springer, Heidelberg (1993). https://doi.org/10.1007/3-540-57318-6_30

    Chapter  Google Scholar 

  10. Alur, R., Dill, D.L.: A theory of timed automata. TCS 126(2), 183–235 (1994). https://doi.org/10.1016/0304-3975(94)90010-8

  11. Alur, R., Henzinger, T.A., Vardi, M.Y.: Parametric real-time reasoning. In: Kosaraju, S.R., Johnson, D.S., Aggarwal, A. (eds.) STOC, pp. 592–601. ACM, New York (1993). https://doi.org/10.1145/167088.167242

  12. Amparore, E., et al.: Presentation of the 9th edition of the model checking contest. In: Beyer, D., Huisman, M., Kordon, F., Steffen, B. (eds.) TACAS 2019. LNCS, vol. 11429, pp. 50–68. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-17502-3_4

    Chapter  Google Scholar 

  13. André, É.: Observer patterns for real-time systems. In: Liu, Y., Martin, A. (eds.) ICECCS, pp. 125–134. IEEE Computer Society, July 2013. https://doi.org/10.1109/ICECCS.2013.26

  14. André, É.: Parametric deadlock-freeness checking timed automata. In: Sampaio, A., Wang, F. (eds.) ICTAC 2016. LNCS, vol. 9965, pp. 469–478. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-46750-4_27

    Chapter  Google Scholar 

  15. André, É.: A benchmark library for parametric timed model checking. In: Artho, C., Ölveczky, P.C. (eds.) FTSCS 2018. CCIS, vol. 1008, pp. 75–83. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-12988-0_5

    Chapter  Google Scholar 

  16. André, É.: IMITATOR user manual (2021). https://github.com/imitator-model-checker/imitator/releases/download/v3.1.0-beta/IMITATOR-user-manual.pdf

  17. André, É., Arcaini, P., Gargantini, A., Radavelli, M.: Repairing timed automata clock guards through abstraction and testing. In: Beyer, D., Keller, C. (eds.) TAP 2019. LNCS, vol. 11823, pp. 129–146. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-31157-5_9

    Chapter  Google Scholar 

  18. André, É., Arias, J., Petrucci, L., van de Pol, J.: Iterative bounded synthesis for efficient cycle detection in parametric timed automata. In: Groote, J.F., Larsen, K.G. (eds.) TACAS (2021)

    Google Scholar 

  19. André, É., Bloemen, V., Petrucci, L., van de Pol, J.: Minimal-time synthesis for parametric timed automata. In: Vojnar, T., Zhang, L. (eds.) TACAS 2019. LNCS, vol. 11428, pp. 211–228. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-17465-1_12

    Chapter  Google Scholar 

  20. André, É., Coti, C., Nguyen, H.G.: Enhanced distributed behavioral cartography of parametric timed automata. In: Butler, M., Conchon, S., Zaïdi, F. (eds.) ICFEM 2015. LNCS, vol. 9407, pp. 319–335. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-25423-4_21

    Chapter  Google Scholar 

  21. 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). https://doi.org/10.1007/978-3-642-32759-9_6

    Chapter  Google Scholar 

  22. André, É., Hasuo, I., Waga, M.: Offline timed pattern matching under uncertainty. In: Lin, A.W., Sun, J. (eds.) ICECCS, pp. 10–20. IEEE Computer Society (2018). https://doi.org/10.1109/ICECCS2018.2018.00010

  23. André, É., Lime, D., Markey, N.: Language preservation problems in parametric timed automata. LMCS 16(1) (2020). https://doi.org/10.23638/LMCS-16(1:5)2020. https://lmcs.episciences.org/6042

  24. André, É., Lin, S.-W.: Learning-based compositional parameter synthesis for event-recording automata. In: Bouajjani, A., Silva, A. (eds.) FORTE 2017. LNCS, vol. 10321, pp. 17–32. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-60225-7_2

    Chapter  Google Scholar 

  25. André, É., Marinho, D., van de Pol, J.: The IMITATOR benchmarks library 2.0: a benchmarks library for extended parametric timed automata, April 2021. https://doi.org/10.5281/zenodo.4730980

  26. Aştefănoaei, L., Bensalem, S., Bozga, M., Cheng, C.-H., Ruess, H.: Compositional parameter synthesis. In: Fitzgerald, J., Heitmeyer, C., Gnesi, S., Philippou, A. (eds.) FM 2016. LNCS, vol. 9995, pp. 60–68. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-48989-6_4

    Chapter  Google Scholar 

  27. Bezděk, P., Beneš, N., Barnat, J., Černá, I.: LTL parameter synthesis of parametric timed automata. In: De Nicola, R., Kühn, E. (eds.) SEFM 2016. LNCS, vol. 9763, pp. 172–187. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-41591-8_12

    Chapter  Google Scholar 

  28. Budde, C.E., Dehnert, C., Hahn, E.M., Hartmanns, A., Junges, S., Turrini, A.: JANI: quantitative model and tool interaction. In: Legay, A., Margaria, T. (eds.) TACAS 2017. LNCS, vol. 10206, pp. 151–168. Springer, Heidelberg (2017). https://doi.org/10.1007/978-3-662-54580-5_9

    Chapter  Google Scholar 

  29. Cassez, F., Larsen, K.: The impressive power of stopwatches. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 138–152. Springer, Heidelberg (2000). https://doi.org/10.1007/3-540-44618-4_12

    Chapter  Google Scholar 

  30. Chen, X., Schupp, S., Makhlouf, I.B., Ábrahám, E., Frehse, G., Kowalewski, S.: A benchmark suite for hybrid systems reachability analysis. In: Havelund, K., Holzmann, G., Joshi, R. (eds.) NFM 2015. LNCS, vol. 9058, pp. 408–414. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-17524-9_29

    Chapter  Google Scholar 

  31. Cimatti, A., Palopoli, L., Ramadian, Y.: Symbolic computation of schedulability regions using parametric timed automata. In: RTSS, pp. 80–89. IEEE Computer Society (2008). https://doi.org/10.1109/RTSS.2008.36

  32. Fehnker, A., Ivančić, F.: Benchmarks for hybrid systems verification. In: Alur, R., Pappas, G.J. (eds.) HSCC 2004. LNCS, vol. 2993, pp. 326–341. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-24743-2_22

    Chapter  MATH  Google Scholar 

  33. Frehse, G., et al.: ARCH-COMP19 category report: hybrid systems with piecewise constant dynamics. In: ARCH@CPSIoTWeek. EPiC Series in Computing, vol. 61, pp. 1–13. EasyChair (2019)

    Google Scholar 

  34. Fribourg, L., Kühne, U.: Parametric verification and test coverage for hybrid automata using the inverse method. Int. J. Found. Comput. Sci. 24(2), 233–249 (2013). https://doi.org/10.1142/S0129054113400091

  35. Henzinger, T.A., Ho, P.-H., Wong-Toi, H.: A user guide to HyTech. In: Brinksma, E., Cleaveland, W.R., Larsen, K.G., Margaria, T., Steffen, B. (eds.) TACAS 1995. LNCS, vol. 1019, pp. 41–71. Springer, Heidelberg (1995). https://doi.org/10.1007/3-540-60630-0_3

    Chapter  Google Scholar 

  36. Hoxha, B., Abbas, H., Fainekos, G.E.: Benchmarks for temporal logic requirements for automotive systems. In: Frehse, G., Althoff, M. (eds.) ARCH@CPSWeek. EPiC Series in Computing, vol. 34, pp. 25–30. EasyChair (2014). http://www.easychair.org/publications/paper/250954

  37. Hune, T., Romijn, J., Stoelinga, M., Vaandrager, F.W.: Linear parametric model checking of timed automata. JLAP 52–53, 183–220 (2002). https://doi.org/10.1016/S1567-8326(02)00037-1

  38. Knapik, M., Penczek, W.: Bounded model checking for parametric timed automata. Trans. Petri Nets Other Models Concurrency 5, 141–159 (2012). https://doi.org/10.1007/978-3-642-29072-5_6

  39. Kwiatkowska, M.Z., Norman, G., Parker, D.: The PRISM benchmark suite. In: Ninth International Conference on Quantitative Evaluation of Systems, QEST 2012, London, United Kingdom, 17–20 September 2012, pp. 203–204. IEEE Computer Society (2012). https://doi.org/10.1109/QEST.2012.14

  40. Larsen, K.G., Pettersson, P., Yi, W.: UPPAAL in a nutshell. STTT 1(1–2), 134–152 (1997). https://doi.org/10.1007/s100090050010

  41. Luthmann, L., Gerecht, T., Stephan, A., Bürdek, J., Lochau, M.: Minimum/maximum delay testing of product lines with unbounded parametric real-time constraints. J. Syst. Softw. 149, 535–553 (2019). https://doi.org/10.1016/j.jss.2018.12.028

  42. Luthmann, L., Stephan, A., Bürdek, J., Lochau, M.: Modeling and testing product lines with unbounded parametric real-time constraints. In: Cohen, M.B., et al. (eds.) SPLC, Volume A, pp. 104–113. ACM (2017). https://doi.org/10.1145/3106195.3106204

  43. Nguyen, H.G., Petrucci, L., van de Pol, J.: Layered and collecting NDFS with subsumption for parametric timed automata. In: Lin, A.W., Sun, J. (eds.) ICECCS, pp. 1–9. IEEE Computer Society, December 2018. https://doi.org/10.1109/ICECCS2018.2018.00009

  44. Quinton, S., Vardanega, T.: 6th International Workshop on Analysis Tools and Methodologies for Embedded and Real-Time Systems (WATERS). http://waters2015.inria.fr/

  45. Shan, L., Graf, S., Quinton, S.: RTLib: A Library of Timed Automata for Modeling Real-Time Systems. Research report, Grenoble 1 UGA - Université Grenoble Alpe; INRIA Grenoble - Rhone-Alpes, November 2016. https://hal.archives-ouvertes.fr/hal-01393888

  46. Sun, Y., André, É., Lipari, G.: Verification of two real-time systems using parametric timed automata. In: Quinton, S., Vardanega, T. (eds.) WATERS, July 2015

    Google Scholar 

Download references

Acknowledgements

Experiments presented in this paper were carried out using the Grid’5000 testbed, supported by a scientific interest group hosted by Inria and including CNRS, RENATER and several Universities as well as other organizations (see https://www.grid5000.fr).

Author information

Authors and Affiliations

  1. Université de Lorraine, CNRS, Inria, LORIA, 54000, Nancy, France

    Étienne André & Dylan Marinho

  2. Department of Computer Science, Aarhus University, Aarhus, Denmark

    Jaco van de Pol

Authors
  1. Étienne André
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dylan Marinho
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jaco van de Pol
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dylan Marinho .

Editor information

Editors and Affiliations

  1. Université d’Orléans, Orléans, France

    Frédéric Loulergue

  2. Graz University of Technology, Graz, Austria

    Franz Wotawa

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

André, É., Marinho, D., van de Pol, J. (2021). A Benchmarks Library for Extended Parametric Timed Automata. In: Loulergue, F., Wotawa, F. (eds) Tests and Proofs. TAP 2021. Lecture Notes in Computer Science(), vol 12740. Springer, Cham. https://doi.org/10.1007/978-3-030-79379-1_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-79379-1_3

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation