4 citations · 6 across the 7 of their papers we have counts for
4 papers · 1 filter
Decisiveness for countable MDPs and insights for NPLCSs and POMDPs
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye +2
Markov chains and Markov decision processes (MDPs) are well-established probabilistic models. While finite Markov models are well-understood, analysing their infinite counterparts…
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…
Alternating Nonzero Automata
Paulin Fournier, Hugo Gimbert
We introduce a new class of automata on infinite trees called \emph{alternating nonzero automata}, which extends the class of non-deterministic nonzero automata. We reduce the empt…
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…