What's decidable about parametric timed automata?

07/03/2019
by   Étienne André, et al.
0

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, restricting the number of clocks, the use of clocks (compared or not with the parameters), and the use of parameters (e.g. used only as upper or lower bounds) leads to decidability of some problems. We also put emphasis on open problems. We also discuss formalisms close to parametric timed automata (such as parametric hybrid automata or parametric interrupt timed automata), and we study tools dedicated to PTAs and their extensions.

READ FULL TEXT

page 8

page 12

research
05/23/2019

Formalizing Time4sys using parametric timed automata

Critical real-time systems must be verified to avoid the risk of dramati...
research
07/18/2018

Language Preservation Problems in Parametric Timed Automata

Parametric timed automata (PTA) are a powerful formalism to model and re...
research
04/20/2020

Reachability and liveness in parametric timed automata

We study timed systems in which some timing features are unknown paramet...
research
06/18/2021

A Benchmarks Library for Extended Parametric Timed Automata

Parametric timed automata are a powerful formalism for reasoning on conc...
research
02/06/2013

Parametric Schedulability Analysis of Fixed Priority Real-Time Distributed Systems

Parametric analysis is a powerful tool for designing modern embedded sys...
research
04/01/2014

Toward Parametric Timed Interfaces for Real-Time Components

We propose here a framework to model real-time components consisting of ...
research
09/15/2018

Parameter Synthesis Problems for one parametric clock Timed Automata

In this paper, we study the parameter synthesis problem for a class of p...

Please sign up or login with your details

Forgot password? Click here to reset