activity
20082019
most citedStatistical Model Checking : An Overview

25 citations · 40 across the 8 of their papers we have counts for

collaborators

8 papers

cs.FL2019★ 1 cited

Consistency in Parametric Interval Probabilistic Timed Automata

Étienne André, Benoît Delahaye, Paulin Fournier

We propose a new abstract formalism for probabilistic timed systems, Parametric Interval Probabilistic Timed Automata, based on an extension of Parametric Timed Automata and Interv…

cs.LO2018★ 4 cited

Parametric Timed Broadcast Protocols

Étienne André, Benoît Delahaye, Paulin Fournier +1

In this paper we consider state reachability in networks composed of many identical processes running a parametric timed broadcast protocol (PTBP). PTBP are a new model extending b…

cs.LO2017

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…

cs.SE2016★ 1 cited

Proceedings Cassting Workshop on Games for the Synthesis of Complex Systems and 3rd International Workshop on Synthesis of Complex Parameters

Thomas Brihaye, Benoît Delahaye, Loïg Jezequel +2

This volume contains the joint proceedings of the Workshop on Games for the Synthesis of Complex Systems (CASSTING'16) and of the 3rd International Workshop on Synthesis of Complex…

cs.LO2013★ 3 cited

Hennessy-Milner Logic with Greatest Fixed Points as a Complete Behavioural Specification Theory

Nikola Beneš, Benoît Delahaye, Uli Fahrenberg +2

There are two fundamentally different approaches to specifying and verifying properties of systems. The logical approach makes use of specifications given as formulae of temporal o…

cs.LO2012★ 3 cited

Refinement and Difference for Probabilistic Automata

Benoît Delahaye, Uli Fahrenberg, Kim G. Larsen +1

This paper studies a difference operator for stochastic systems whose specifications are represented by Abstract Probabilistic Automata (APAs). In the case refinement fails between…