What’s decidable about parametric timed automata?

@article{Andr2015WhatsDA,
  title={What’s decidable about parametric timed automata?},
  author={{\'E}tienne Andr{\'e}},
  journal={International Journal on Software Tools for Technology Transfer},
  year={2015},
  volume={21},
  pages={203 - 219}
}
  • É. André
  • Published 6 November 2015
  • Computer Science
  • International Journal on Software Tools for Technology Transfer
Parametric timed automata (PTAs) are a powerful formalism to reason, simulate and formally verify critical real-time systems. After 25 years of research on PTAs, it is now well understood that any non-trivial problem studied is undecidable for general PTAs. We provide here a survey of decision and computation problems for PTAs. On the one hand, bounding time, bounding the number of parameters or the domain of the parameters does not (in general) lead to any decidability. On the other hand… 
View on Springer
arxiv.org
8 Citations
Background Citations
2

8 Citations

What’s decidable about parametric timed automata?

  • É. André
  • Computer Science
    International Journal on Software Tools for Technology Transfer
  • 2017
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.

On the Expressive Power of Invariants in Parametric Timed Automata

A syntactic restriction on PTAs consisting in removing guards to keep only invariants is proposed to allow for an interesting trade-off between decidability and practical expressiveness and is therefore promising.

F L ] 1 2 Ju n 20 19 Consistency in Parametric Interval Probabilistic Timed Automata ∗

It is shown that the existence of timing parameter valuations ensuring consistency is undecidable in the general context, but still exhibit a syntactic condition on parameters to ensure decidability.

Compositional Liveness-Preserving Conformance Testing of Timed I/O Automata - Technical Report

An improved version of tioco is proposed, called live timed ioco (ltioco), tackling various weaknesses of existing definitions and extending the theory of zone graphs to enable ltioco testing on a finite semantic model of TIOA.

1 J ul 2 01 9 Parametric Verification : An Introduction ⋆

This paper first introduces motivation behind parametric verification in general, and then focuses on different models and approaches, for verifying several kinds of systems, including Parametric Timed Automata, for modelling real-time systems, where the timing constraints are not necessarily known a priori.

Parametric Timed Bisimulation

Scenario-Based Online Reachability Validation for CPS Fault Prediction

This article first proposes the concept of parametric hybrid automata (PHA) to describe such complex CPSs, and proposes a mechanism to compose/decompose scenarios to carry out PHA model checking online, as a fault prediction mechanism.

Parametric Verification: An Introduction

This paper presents not only the basic formal concepts tackled in the video version, but also an extensive literature to provide the reader with further references covering the area, to introduce motivation behind parametric verification in general and focus on different models and approaches for verifying several kinds of systems.

References

SHOWING 1-10 OF 35 REFERENCES

Language Emptiness of Continuous-Time Parametric Timed Automata

This work shows that the parametric language emptiness is decidable for parametric timed automata with three clocks and one parameter, the first positive result in the case of continuous-time and unbounded integer parameters.

Integer Parameter Synthesis for Timed Automata

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

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.

Integer Parameter Synthesis for Real-Time Systems

This work provides a subclass of parametric timed automata (PTA) that it is argued that it retains most of the practical usefulness of PTA for the modeling of real-time systems and shows that the problem of the existence of parameter values such that some TCTL property is satisfied is PSPACE-complete.

Language Preservation Problems in Parametric Timed Automata

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…

Decision problems for lower/upper bound parametric timed automata

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.

Decision Problems for Parametric Timed Automata

This paper exhibits a subclass of PTAs with bounded rational-valued parameters for which the parametric reachability emptiness problem is decidable, and presents further results improving the boundary between decidability and undecidability for PTAs and their subclasses.

Decidability and Complexity Results for Timed Automata and Semi-linear Hybrid Automata

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.

Linear parametric model checking of timed automata

A Theory of Timed Automata