TCTL Model Checking Lower/Upper-Bound Parametric Timed Automata Without Invariants

Abstract : We study timed systems in which some timing features are unknown parameters. First we consider Upper-bound Parametric Timed Automata (U-PTAs), one of the simplest extensions of timed automata with parameters, in which parameters are only used as clock upper bounds in the constraints. Up to now, there have been several decid-ability results for the existence of parameter values in U-PTAs such that flat TCTL formulas are satisfied. We prove here that this does not extend to the full logic and that only one level of nesting leads to undecidability. This provides, to the best of our knowledge, the first problem that is de-cidable for Timed Automata with an undecidable parametric emptiness version for U-PTAs. Second we study Lower/Upper-bound Parametric Timed Automata (L/U-PTAs) in which parameters are used either as clock lower bound, or as clock upper bound, but not both. We prove that without invariants, flat TCTL is decidable for L/U-PTAs by resolving the last non investigated liveness properties.
Document type :
Conference papers
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01957138
Contributor : Didier Lime <>
Submitted on : Monday, December 17, 2018 - 10:30:29 AM
Last modification on : Tuesday, March 26, 2019 - 9:25:22 AM
Document(s) archivé(s) le : Monday, March 18, 2019 - 2:09:43 PM

File

andre-FORMATS-18.pdf
Files produced by the author(s)

Identifiers

Citation

Etienne André, Didier Lime, Mathias Ramparison. TCTL Model Checking Lower/Upper-Bound Parametric Timed Automata Without Invariants. 16th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS 2018), Sep 2018, Beijing, China. pp.37-52, ⟨10.1007/978-3-030-00151-3_3⟩. ⟨hal-01957138⟩

Share

Metrics

Record views

32

Files downloads

17