4 papers
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.…
Parametric Verification: An Introduction
Étienne André, Michał Knapik, Didier Lime +2
This paper constitutes a short introduction to parametric verification of concurrent systems. It originates from two 1-day tutorial sessions held at the Petri nets conferences in T…
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…
Reachability in Parametric Interval Markov Chains using Constraints
Anicet Bart, Benoit Delahaye, Didier Lime +2
Parametric Interval Markov Chains (pIMCs) are a specification formalism that extend Markov Chains (MCs) and Interval Markov Chains (IMCs) by taking into account imprecision in the…