6 citations · 14 across the 10 of their papers we have counts for
Showing cs.FLShow all
3 papers · 1 filter
cs.FL2024
Execution-time opacity problems in one-clock parametric timed automata
Étienne André, Johan Arcile, Engel Lefaucheux
Parametric timed automata (PTAs) extend the concept of timed automata, by allowing timing delays not only specified by concrete values but also by parameters, allowing the analysis…
cs.FL2024
Parameterized Verification of Timed Networks with Clock Invariants
Étienne André, Swen Jacobs, Shyam Lal Karra +1
We consider parameterized verification problems for networks of timed automata (TAs) based on different communication primitives. To this end, we first consider disjunctive timed n…
cs.FL2024
Hyper parametric timed CTL
Masaki Waga, Étienne André
Hyperproperties enable simultaneous reasoning about multiple execution traces of a system and are useful to reason about non-interference, opacity, robustness, fairness, observatio…