Abstract
Parametric timed automata extend the standard timed automata with the possibility to use parameters in the clock guards. In general, if the parameters are real-valued, the problem of language emptiness of such automata is undecidable even for various restricted subclasses. We thus focus on the case where parameters are assumed to be integer-valued, while the time still remains continuous. On the one hand, we show that the problem remains undecidable for parametric timed automata with three clocks and one parameter. On the other hand, for the case with arbitrary many clocks where only one of these clocks is compared with (an arbitrary number of) parameters, we show that the parametric language emptiness is decidable. The undecidability result tightens the bounds of a previous result which assumed six parameters, while the decidability result extends the existing approaches that deal with discrete-time semantics only. To the best of our knowledge, this is the first positive result in the case of continuous-time and unbounded integer parameters, except for the rather simple case of single-clock automata.
Nikola Beneš has been supported by the Czech Science Foundation grant project no. GA15-11089S.
Peter Bezděk has been supported by the Czech Science Foundation grant project no. GA15-08772S.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Alur, R., Courcoubetis, C., Dill, D.: Model-checking for real-time systems. In: LICS 1990. pp. 414–425. IEEE (1990)
Alur, R., Dill, D.: A theory of timed automata. Theoretical Computer Science 126(2), 183–235 (1994)
Alur, R., Henzinger, T., Vardi, M.: Parametric real-time reasoning. In: Proceedings of 25th Annual Symposium on Theory of Computing (STOC 1993), pp. 592–601. ACM Press (1993)
André, É., Chatain, T., Fribourg, L., Encrenaz, E.: An inverse method for parametric timed automata. ENTCS 223, 29–46 (2008)
Behrmann, Gerd, Fehnker, Ansgar, Hune, Thomas, Larsen, Kim Guldstrand, Pettersson, Paul, Romijn, Judi M.T., Vaandrager, Frits W.: Minimum-cost reachability for priced timed automata. In: Di Benedetto, Maria Domenica, Sangiovanni-Vincentelli, Alberto L. (eds.) HSCC 2001. LNCS, vol. 2034, pp. 147–161. Springer, Heidelberg (2001)
Beneš, N., Bezděk, P., Larsen, K.G., Srba, J.: Language emptiness of continuous-time parametric timed automata (2015). CoRR abs/1504.07838
Bouyer, P., Brihaye, T., Markey, N.: Improved undecidability results on weighted timed automata. Inform. Proc. Letters 98(5), 188–194 (2006)
Bozzelli, L., La Torre, S.: Decision problems for lower/upper bound parametric timed automata. Formal Methods in Syst. Design 35(2), 121–151 (2009)
Bruyère, Véronique, Raskin, Jean-François: Real-time model-checking: parameters everywhere. In: Pandya, Paritosh K., Radhakrishnan, Jaikumar (eds.) FSTTCS 2003. LNCS, vol. 2914, pp. 100–111. Springer, Heidelberg (2003)
Bundala, Daniel, Ouaknine, Joël: Advances in parametric real-time reasoning. In: Csuhaj-Varjú, Erzsébet, Dietzfelbinger, Martin, Ésik, Zoltán (eds.) MFCS 2014, Part I. LNCS, vol. 8634, pp. 123–134. Springer, Heidelberg (2014)
Bérard, Beatrice, Haddad, Serge, Jovanović, Aleksandra, Lime, Didier: Parametric interrupt timed automata. In: Abdulla, Parosh Aziz, Potapov, Igor (eds.) RP 2013. LNCS, vol. 8169, pp. 59–69. Springer, Heidelberg (2013)
Doyen, L.: Robust parametric reachability for timed automata. Information Processing Letters 102(5), 208–213 (2007)
Feo-Arenis, Sergio, Westphal, Bernd, Dietsch, Daniel, Muñiz, Marco, Andisha, Ahmad Siyar: The wireless fire alarm system: ensuring conformance to industrial standards through formal verification. In: Jones, Cliff, Pihlajasaari, Pekka, Sun, Jun (eds.) FM 2014. LNCS, vol. 8442, pp. 658–672. Springer, Heidelberg (2014)
Hune, Thomas, Romijn, Judi M.T., Stoelinga, Mariëlle, Vaandrager, Frits W.: Linear parametric model checking of timed automata. In: Margaria, Tiziana, Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 189–203. Springer, Heidelberg (2001)
Jovanović, Aleksandra, Lime, Didier, Roux, Olivier H.: Integer parameter synthesis for timed automata. In: Piterman, Nir, Smolka, Scott A. (eds.) TACAS 2013 (ETAPS 2013). LNCS, vol. 7795, pp. 401–415. Springer, Heidelberg (2013)
Kuzmin, E., Chalyy, D.: Decidability of boundedness problems for Minsky counter machines. Automatic Control and Computer Sciences 44(7), 387–397 (2010)
Miller, Joseph S.: Decidability and complexity results for timed automata and semi-linear hybrid automata. In: Lynch, Nancy A., Krogh, Bruce H. (eds.) HSCC 2000. LNCS, vol. 1790, pp. 296–310. Springer, Heidelberg (2000)
Minsky, M.: Computation: Finite and Infinite Machines. Prentice (1967)
Wang, F.: Parametric timing analysis for real-time systems. Information and Computation 130(2), 131–150 (1996)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beneš, N., Bezděk, P., Larsen, K.G., Srba, J. (2015). Language Emptiness of Continuous-Time Parametric Timed Automata. In: Halldórsson, M., Iwama, K., Kobayashi, N., Speckmann, B. (eds) Automata, Languages, and Programming. ICALP 2015. Lecture Notes in Computer Science(), vol 9135. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-47666-6_6
Download citation
DOI: https://doi.org/10.1007/978-3-662-47666-6_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-47665-9
Online ISBN: 978-3-662-47666-6
eBook Packages: Computer ScienceComputer Science (R0)