Language Emptiness of Continuous-Time Parametric Timed Automata

@inproceedings{Benes2015LanguageEO,
  title={Language Emptiness of Continuous-Time Parametric Timed Automata},
  author={Nikola Benes and Peter Bezdek and Kim Guldstrand Larsen and Jir{\'i} Srba},
  booktitle={ICALP},
  year={2015}
}
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… 
Reachability in two-parametric timed automata with one parameter is EXPSPACE-complete
TLDR
The main result is that the reachability problem for two-parametric timed automata with one parameter is EXPSPACE-complete, and a series of techniques to partition a fictitious run of a POCA into several carefully chosen subruns that allow us to prove that it is sufficient to consider a parameter value of exponential magnitude only.
Timed Automata with Parametric Updates
TLDR
While the EF-emptiness problem is undecidable for rational-valued parameters, it becomes PSPACE-complete for integer-valuedparametric extensions and exact synthesis of the parameter valuations set can be achieved.
What’s decidable about parametric timed automata?
  • É. André
  • Computer Science
    International Journal on Software Tools for Technology Transfer
  • 2017
TLDR
A survey of decision and computation problems for PTAs, including formalisms close to parametric timed automata (such as parametric hybrid automata or parametric interrupt timedAutomata), and tools dedicated to PTAs and their extensions are studied.
Parametric updates in parametric timed automata
TLDR
This work introduces a new class of Parametric Timed Automata (PTAs) where clocks are allowed to be compared to parameters in guards, as in classic PTAs, but also to be updated to parameters.
TCTL Model Checking Lower/Upper-Bound Parametric Timed Automata Without Invariants
TLDR
It is proved that without invariants, flat TCTL is decidable for L/U-PTAs by resolving the last non investigated liveness properties.
On the Expressiveness of Parametric Timed Automata
TLDR
Two definitions for the expressiveness of parametric timed models are proposed: the first in terms of all the untimed words that can be generated for all possible valuations of the parameters, the second with the additional information of which parameter valuations allow which word, thus more suitable for synthesis issues.
Liveness in L/U-Parametric Timed Automata
  • É. André, D. Lime
  • Computer Science, Mathematics
    2017 17th International Conference on Application of Concurrency to System Design (ACSD)
  • 2017
TLDR
This work proves that: (1) the existence of at least one parameter valuation for which there exists an infinite run in the automaton is PSPACE-complete, and (2) theexistence of a parameter valuation such that the system has a deadlock is however undecidable.
Reachability and liveness in parametric timed automata
TLDR
This paper exhibits a subclass of PTAs with bounded rational-valued parameters for which the parametric reachability emptiness problem is decidable, and proves that the existence of at least one parameter valuation for which there exists an infinite run in an L/U-PTA is PSPACE-complete.
What's Decidable About Parametric Timed Automata?
TLDR
A survey of decision and computation problems forParametric timed automata, a powerful formalism to reason, simulate and formally verify critical real-time systems, is provided.
...
...

References

SHOWING 1-10 OF 20 REFERENCES
An Inverse Method for Parametric Timed Automata
Integer Parameter Synthesis for Timed Automata
TLDR
This work provides a subclass of parametric timed automata (PTA) that it is argued that it retains most of the practical usefulness of PTA, and shows that the problem of the existence of parameter values such that some TCTL property is satisfied is PSPACE-complete.
Parametric real-time reasoning
TLDR
This work addresses the more realistic and more ambitious problem of deriving symbolic constraints on the timing properties required of real-time systems by introducing parametric timed automata whose transitions are constrained with parametric timing requirements.
Decision Problems for Lower/Upper Bound Parametric Timed Automata
TLDR
It is shown that basic decision problems, such as emptiness, finiteness and universality of the set of parameter valuations for which there is a corresponding infinite accepting run of the automaton, is Pspace-complete.
Decidability and Complexity Results for Timed Automata and Semi-linear Hybrid Automata
TLDR
It is shown that the existence of a Zeno run is Σ11 -complete for semi-linear hybrid automata; it is too complex to be expressed in first-order arithmetic.
A Theory of Timed Automata
Linear Parametric Model Checking of Timed Automata
Real-Time Model-Checking: Parameters Everywhere
TLDR
It is shown that the model-checking problem of TCTL extended with parameters is undecidable over discrete-timed automata with only one parametric clock.
Minimum-Cost Reachability for Priced Timed Automata
TLDR
This paper proves decidability of the minimum-cost reachability problem by offering an algorithmic solution, which is based on a combination of branch-and-bound techniques and a new notion of priced regions, which allows symbolic representation and manipulation of reachable states together with the cost of reaching them.
Parametric Interrupt Timed Automata
TLDR
It is proved that different reachability problems, including robust reachability, are decidable for this model, and the complexity upper bounds for a fixed or variable number of clocks and parameters are given.
...
...