61 citations · 322 across the 42 of their papers we have counts for
4 papers · 2 filters
What's decidable about parametric timed automata?
Étienne André
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-und…
Parametric Verification: An Introduction
Étienne André, Michał Knapik, Didier Lime +2
This paper constitutes a short introduction to parametric verification of concurrent systems. It originates from two 1-day tutorial sessions held at the Petri nets conferences in T…
Repairing Timed Automata Clock Guards through Abstraction and Testing
Étienne André, Paolo Arcaini, Angelo Gargantini +1
Timed automata (TAs) are a widely used formalism to specify systems having temporal requirements. However, exactly specifying the system may be difficult, as the user may not know…
Minimal-Time Synthesis for Parametric Timed Automata
Étienne André, Vincent Bloemen, Laure Petrucci +1
Parametric timed automata (PTA) extend timed automata by allowing parameters in clock constraints. Such a formalism is for instance useful when reasoning about unknown delays in a…