activity
20092024
most citedWhat's decidable about parametric timed automata?

61 citations · 322 across the 42 of their papers we have counts for

collaborators
Showing 2019Show all

14 papers · 1 filter

cs.FL2019

On the expressive power of invariants in parametric timed automata

Étienne André, Didier Lime, Mathias Ramparison

The verification of systems combining hard timing constraints with concurrency is challenging. This challenge becomes even harder when some timing constants are missing or unknown.…

cs.SE2019★ 4 cited

Time4sys2imi: A tool to formalize real-time system models under uncertainty

Étienne André, Jawher Jerray, Sahar Mhiri

Time4sys is a formalism developed by Thales, realizing a graphical specification for real-time systems. However, this formalism does not allow to perform formal analyses for real-t…

cs.LO2019★ 61 cited

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…

cs.LO2019★ 5 cited

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…

cs.CR2019★ 6 cited

Parametric Timed Model Checking for Guaranteeing Timed Opacity

Étienne André, Jun Sun

Information leakage can have dramatic consequences on systems security. Among harmful information leaks, the timing information leakage is the ability for an attacker to deduce int…

cs.LO2019

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…