Skip to main content
SpringerLink
Log in

Language Preservation Problems in Parametric Timed Automata

  • Conference paper
  • First Online:
Formal Modeling and Analysis of Timed Systems (FORMATS 2015)

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

Abstract

Parametric timed automata (PTA) are a powerful formalism to model and reason about concurrent systems with some unknown timing delays. In this paper, we address the (untimed) language- and trace-preservation problems: given a reference parameter valuation, does there exist another parameter valuation with the same untimed language (or trace)? We show that these problems are undecidable both for general PTA, and even for the restricted class of L/U-PTA. On the other hand, we exhibit decidable subclasses: 1-clock PTA, and 1-parameter deterministic L-PTA and U-PTA.

This work is partially supported by the ANR national research program PACS (ANR-14-CE28-0002), and by European projects ERC EQualIS (308087) and FET Cassting (601148).

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alur, R., Dill, D.: Automata for modeling real-time systems. In: Paterson, M.S. (ed.) Automata, Languages and Programming. LNCS, vol. 443, pp. 322–335. Springer, Heidelberg (1990)

    Chapter  Google Scholar 

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

    Google Scholar 

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

    MATH  Google Scholar 

  4. André, É., Markey, N.: Language preservation problems in parametric timed automata. Research Report LSV-15-05, Laboratoire Spécification et Vérification, ENS Cachan, France, June 2015

    Google Scholar 

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

    Chapter  Google Scholar 

  6. Bozzelli, L., La Torre, S.: Decision problems for lower/upper bound parametric timed automata. FMSD 35(2), 121–151 (2009)

    MATH  Google Scholar 

  7. De Wulf, M., Doyen, L., Markey, N., Raskin, J.-F.: Robust safety of timed automata. FMSD 33(1–3), 45–84 (2008)

    MATH  Google Scholar 

  8. Hune, T., Romijn, J., Stoelinga, M., Vaandrager, F.: Linear parametric model checking of timed automata. Journal of Logic and Algebraic Programming 52–53, 183–220 (2002)

    Article  MathSciNet  Google Scholar 

  9. Jovanović, A., Lime, D., Roux, O.H.: Integer parameter synthesis for timed automata. IEEE Transactions on Software Engineering 41(5), 445–461 (2015)

    Article  Google Scholar 

  10. 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 

  11. Sankur, O.: Untimed language preservation in timed systems. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol. 6907, pp. 556–567. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  12. Sankur, O.: Robustness in Timed Automata: Analysis, Synthesis, Implementation. Thèse de doctorat, Laboratoire Spécification & Vérification, ENS Cachan, France (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université Paris 13, Sorbonne Paris Cité, LIPN, CNRS, Villetaneuse, France

    Étienne André

  2. LSV, CNRS and ENS Cachan, Cachan, France

    Nicolas Markey

Authors
  1. Étienne André
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nicolas Markey
    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. University of Colorado, Boulder, Colorado, USA

    Sriram Sankaranarayanan

  2. University of Florence, Florence, Italy

    Enrico Vicario

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

André, É., Markey, N. (2015). Language Preservation Problems in Parametric Timed Automata. In: Sankaranarayanan, S., Vicario, E. (eds) Formal Modeling and Analysis of Timed Systems. FORMATS 2015. Lecture Notes in Computer Science(), vol 9268. Springer, Cham. https://doi.org/10.1007/978-3-319-22975-1_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-22975-1_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-22974-4

  • Online ISBN: 978-3-319-22975-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation