2 papers
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.CR2019
Parametric analyses of attack-fault trees
Étienne André, Didier Lime, Mathias Ramparison +1
Risk assessment of cyber-physical systems, such as power plants, connected devices and IT-infrastructures has always been challenging: safety (i.e. absence of unintentional failure…