5 citations · 5 across the 2 of their papers we have counts for
Showing cs.FLShow all
2 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.FL2019★ 5 cited
Parametric updates in parametric timed automata
Étienne André, Didier Lime, Mathias Ramparison
We introduce a new class of Parametric Timed Automata (PTAs) where we allow clocks to be compared to parameters in guards, as in classic PTAs, but also to be updated to parameters.…