11 citations · 22 across the 3 of their papers we have counts for
3 papers
cs.LO2019★ 11 cited
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…
cs.LO2018★ 11 cited
A benchmark library for parametric timed model checking
André Étienne
Verification of real-time systems involving hard timing constraints and concurrency is of utmost importance. Parametric timed model checking allows for formal verification in the p…
cs.PL2018
Quasi-Optimal Partial Order Reduction
Huyen T. T Nguyen, César Rodríguez, Marcelo Sousa +2
A dynamic partial order reduction (DPOR) algorithm is optimal when it always explores at most one representative per Mazurkiewicz trace. Existing literature suggests that the reduc…