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

Decision Problems for Parametric Timed Automata

  • Conference paper
  • First Online:
Formal Methods and Software Engineering (ICFEM 2016)

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

Included in the following conference series:

  • 869 Accesses

Abstract

Parametric timed automata (PTAs) allow to reason on systems featuring concurrency and timing constraints making use of parameters. Most problems are undecidable for PTAs, including the parametric reachability emptiness problem, i.e., whether at least one parameter valuation allows to reach some discrete state. In this paper, we first exhibit a subclass of PTAs (namely integer-points PTAs) with bounded rational-valued parameters for which the parametric reachability emptiness problem is decidable. Second, we present further results improving the boundary between decidability and undecidability for PTAs and their subclasses.

This work is partially supported by the ANR national research program “PACS” (ANR-14-CE28-0002).

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 bounded integer PTAs of [14] are arguably a trivial such subclass (even though the associated analysis techniques are not).

References

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  3. André, É.: What’s decidable about parametric timed automata? In: Ölveczky, P.C., Artho, C. (eds.) Formal Techniques for Safety-Critical Systems. CCIS, vol. 596, pp. 1–17. Springer, Heidelberg (2015)

    Google Scholar 

  4. André, É., Chatain, T., Encrenaz, E., Fribourg, L.: An inverse method for parametric timed automata. IJFCS 20(5), 819–836 (2009)

    MathSciNet  MATH  Google Scholar 

  5. André, É., Lime, D.: Liveness in L/U-parametric timed automata (2016, submitted). https://hal.archives-ouvertes.fr/hal-01304232

  6. André, É., Lime, D., Roux, O.H.: Integer-complete synthesis for bounded parametric timed automata. In: Bojanczyk, M., et al. (eds.) RP 2015. LNCS, vol. 9328, pp. 7–19. Springer, Heidelberg (2015). doi:10.1007/978-3-319-24537-9_2

    Chapter  Google Scholar 

  7. André, É., Lime, D., Roux, O.H.: On the expressiveness of parametric timed automata. In: Fränzle, M., Markey, N. (eds.) FORMATS 2016. LNCS, vol. 9884, pp. 19–34. Springer, Heidelberg (2016). doi:10.1007/978-3-319-44878-7_2

    Chapter  Google Scholar 

  8. Beneš, N., Bezděk, P., Larsen, K.G., Srba, J.: Language emptiness of continuous-time parametric timed automata. In: Halldórsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 69–81. Springer, Heidelberg (2015)

    Google Scholar 

  9. Bengtsson, J.E., Yi, W.: Timed automata: semantics, algorithms and tools. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) Lectures on Concurrency and Petri Nets. LNCS, vol. 3098, pp. 87–124. Springer, Heidelberg (2004)

    Chapter  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  MATH  Google Scholar 

  11. Doyen, L.: Robust parametric reachability for timed automata. Inf. Process. Lett. 102(5), 208–213 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  12. Henzinger, T., Kopke, P., Puri, A., Varaiya, P.: What’s decidable about hybrid automata? J. Comput. Syst. Sci. 57, 94–124 (1998)

    Article  MathSciNet  MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  14. Jovanović, A., Lime, D., Roux, O.H.: Integer parameter synthesis for timed automata. Trans. Softw. Eng. 41(5), 445–461 (2015)

    Article  MATH  Google Scholar 

  15. Miller, J.S.: Decidability and complexity results for timed automata and semi-linear hybrid automata. In: Lynch, N.A., Krogh, B.H. (eds.) HSCC 2000. LNCS, vol. 1790, pp. 296–309. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  16. Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall Inc., Upper Saddle River (1967)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. École Centrale de Nantes, IRCCyN, CNRS, UMR 6597, Nantes, France

    Étienne André, Didier Lime & Olivier H. Roux

  2. Université Paris 13, Sorbonne Paris Cité, LIPN, CNRS, UMR 7030, Villetaneuse, France

    Étienne André

Authors
  1. Étienne André
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Didier Lime
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Olivier H. Roux
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Étienne André .

Editor information

Editors and Affiliations

  1. School of Information Science, Japan Advanced Institute of Science and Technology (JAIST), Nomi, Japan

    Kazuhiro Ogata

  2. Department of Computing and Software, McMaster University, Hamilton, Ontario, Canada

    Mark Lawford

  3. Department of Computer Science, Hosei University, Tokyo, Japan

    Shaoying Liu

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

André, É., Lime, D., Roux, O.H. (2016). Decision Problems for Parametric Timed Automata. In: Ogata, K., Lawford, M., Liu, S. (eds) Formal Methods and Software Engineering. ICFEM 2016. Lecture Notes in Computer Science(), vol 10009. Springer, Cham. https://doi.org/10.1007/978-3-319-47846-3_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-47846-3_25

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-47845-6

  • Online ISBN: 978-3-319-47846-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation