Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

On Completeness of Liveness Synthesis for Parametric Timed Automata (Extended Abstract)

  • Conference paper
  • First Online:
Recent Trends in Algebraic Development Techniques (WADT 2020)

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

Included in the following conference series:

Abstract

We discuss what kind of completeness guarantees can be provided by semi-algorithms for the synthesis of the set of parameters under which a parametric timed automata meets some liveness property.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Similar content being viewed by others

Notes

  1. 1.

    The full version of this paper will be presented at TACAS [3].

References

  1. Alur, R., Henzinger, T.A., Vardi, M.Y.: Parametric real-time reasoning. In: STOC, pp. 592–601. ACM (1993)

    Google Scholar 

  2. André, É.: What’s decidable about parametric timed automata? Int. J. Softw. Tools Technol. Transfer 21, 203–219 (2019)

    Article  Google Scholar 

  3. André, É., Arias, J., Petrucci, L., van de Pol, J.: Iterative bounded synthesis for efficient cycle detection. In: Groote, J.F., Larsen, K.G. (eds.) TACAS (Part I). Lecture Notes in Computer Science, vol. 12651, pp. 311–329. Springer, Heidelberg (2021)

    Google Scholar 

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

    Chapter  Google Scholar 

  5. André, É., Knapik, M., Lime, D., Penczek, W., Petrucci, L.: Parametric verification: an introduction. Trans. Petri Nets Other Model. Concurr. 14, 64–100 (2019)

    Article  Google Scholar 

  6. André, É., Lime, D.: Liveness in L/U-parametric timed automata. In ACSD, pp. 9–18. IEEE Computer Society (2017)

    Google Scholar 

  7. André, É., Lime, D., Roux, O.H.: Integer-complete synthesis for bounded parametric timed automata. In: Bojańczyk, M., Lasota, S., Potapov, I. (eds.) RP 2015. LNCS, vol. 9328, pp. 7–19. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-24537-9_2

    Chapter  Google Scholar 

  8. 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)

    Article  Google Scholar 

  9. Bezdek, P., Benes, N., Barnat, J., Cerná, I.: LTL parameter synthesis of parametric timed automata. In Software Engineering and Formal Methods - 14th International Conference, SEFM 2016, Proceedings, pp. 172–187 (2016)

    Google Scholar 

  10. Bozzelli, L., La Torre, S.: Decision problems for lower/upper bound parametric timed automata. Formal Methods Syst. Des. 35(2), 121–151 (2009)

    Article  Google Scholar 

  11. Courcoubetis, C., Vardi, M.Y., Wolper, P., Yannakakis, M.: Memory-efficient algorithms for the verification of temporal properties. Formal Methods Syst. Des. 1(2/3), 275–288 (1992)

    Article  Google Scholar 

  12. Daws, C., Tripakis, S.: Model checking of real-time reachability properties using abstractions. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol. 1384, pp. 313–329. Springer, Heidelberg (1998). https://doi.org/10.1007/BFb0054180

    Chapter  Google Scholar 

  13. Hune, T., Romijn, J., Stoelinga, M., Vaandrager, F.W.: Linear parametric model checking of timed automata. J. Log. Algebr. Program. 52–53, 183–220 (2002)

    Article  MathSciNet  Google Scholar 

  14. Laarman, A.W., Olesen, M.C., Dalsgaard, A.E., Larsen, K.G., van de Pol, J.C.: Multi-core emptiness checking of timed Büchi automata using inclusion abstraction. In: Computer Aided Verification (CAV’13), pp. 968–983 (2013)

    Google Scholar 

  15. 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.) 23rd IEEE IC on Engineering of Complex Computer Systems (ICECCS 2018), Melbourne, Australia, pp. 1–9. IEEE (2018)

    Google Scholar 

Download references

Acknowledgement

This work was supported by travel grants PAMPAS (Van Gogh programme, Campus France & NUFFIC), TrAVAIL (CNRS-INS2I), and SECReTS (Institut Français Danemark). We thank Étienne André and Jaime Arias for interesting discussions, and for their help with the integration of our algorithms in the Imitator tool.

Author information

Authors and Affiliations

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

    Jaco van de Pol

  2. FMT, University of Twente, Enschede, The Netherlands

    Jaco van de Pol

  3. LIPN, CNRS UMR 7030, Université Sorbonne Paris Nord, Villetaneuse, France

    Laure Petrucci

Authors
  1. Jaco van de Pol
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Laure Petrucci
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jaco van de Pol .

Editor information

Editors and Affiliations

  1. Swansea University, Swansea, UK

    Markus Roggenbach

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

van de Pol, J., Petrucci, L. (2021). On Completeness of Liveness Synthesis for Parametric Timed Automata (Extended Abstract). In: Roggenbach, M. (eds) Recent Trends in Algebraic Development Techniques. WADT 2020. Lecture Notes in Computer Science(), vol 12669. Springer, Cham. https://doi.org/10.1007/978-3-030-73785-6_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-73785-6_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-73784-9

  • Online ISBN: 978-3-030-73785-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation