61 citations · 322 across the 42 of their papers we have counts for
11 papers · 1 filter
Efficient Convex Zone Merging in Parametric Timed Automata
Étienne André, Dylan Marinho, Laure Petrucci +1
Parametric timed automata are a powerful formalism for reasoning on concurrent real-time systems with unknown or uncertain timing constants. Reducing their state space is a signifi…
Exemplifying parametric timed specifications over signals with bounded behavior
Étienne André, Masaki Waga, Natsuki Urabe +1
Specifying properties can be challenging work. In this paper, we propose an automated approach to exemplify properties given in the form of automata extended with timing constraint…
Zone extrapolations in parametric timed automata
Johan Arcile, Étienne André
Timed automata (TAs) are an efficient formalism to model and verify systems with hard timing constraints, and concurrency. While TAs assume exact timing constants with infinite pre…
Parametric non-interference in timed automata
Étienne André, Aleksander Kryukov
We consider a notion of non-interference for timed automata (TAs) that allows to quantify the frequency of an attack; that is, we infer values of the minimal time between two conse…
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.…
Consistency in Parametric Interval Probabilistic Timed Automata
Étienne André, Benoît Delahaye, Paulin Fournier
We propose a new abstract formalism for probabilistic timed systems, Parametric Interval Probabilistic Timed Automata, based on an extension of Parametric Timed Automata and Interv…