Timed automata are a common formalism for the verification of concurrent systems subject to
timing constraints. They extend finite-state automata with clocks, that constrain the system …

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 …

Parametric timed automata are a powerful formalism for reasoning on concurrent real-time
systems with unknown or uncertain timing constants. In order to test the efficiency of new …

This paper presents a rewriting logic “interpreter” for networks of parametric timed automata
with global variables (NPTAVs) in Real-Time Maude style. Since explicit-state analysis is not …

We study semi-algorithms to synthesise the constraints under which a Parametric Timed
Automaton satisfies some liveness requirement. The algorithms traverse a possibly infinite …

This paper presents a rewriting logic semantics for parametric timed automata (PTAs) and
shows that symbolic reachability analysis using Maude-with-SMT is sound and complete for …

This paper studies the analysis and parameter synthesis problems for Parametric Timed
Automata (PTA) with properties in Linear-time Temporal Logic (LTL). It introduces a series of …

Parametric timed automata (PTA) are a powerful formalism to reason, simulate and formally
verify critical real-time systems. After two decades of research on PTA, it is now well …

This book introduces state-of-the-art verification techniques for real-time embedded systems,
based on the inverse method for parametric timed automata. It reviews popular formalisms …

We consider the problem of automatically finding safe and robust values of timing
parameters of cardiac pacemaker models so that a quantitative objective, such as the …