Analysing Decisive Stochastic Processes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

Analysing Decisive Stochastic Processes


In 2007, Abdulla et al. introduced the elegant concept of decisive Markov chain. Intuitively, de-cisiveness allows one to lift the good properties of finite Markov chains to infinite Markov chains. For instance, the approximate quantitative reachability problem can be solved for decisive Markov chains (enjoying reasonable effectiveness assumptions) including probabilistic lossy channel systems and probabilistic vector addition systems with states. In this paper, we extend the concept of decisiveness to more general stochastic processes. This extension is non trivial as we consider stochastic processes with a potentially continuous set of states and uncountable branching (common features of real-time stochastic processes). This allows us to obtain decidability results for both qualitative and quantitative verification problems on some classes of real-time stochastic processes, including generalized semi-Markov processes and stochastic timed automata.
Fichier principal
Vignette du fichier
BBBC-icalp16.pdf (462.76 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01397794 , version 1 (16-11-2016)



Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Pierre Carlier. Analysing Decisive Stochastic Processes. 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), 2016, Rome, Italy. pp.101:1-101:14, ⟨10.4230/LIPIcs.ICALP.2016.101⟩. ⟨hal-01397794⟩
470 View
84 Download



Gmail Facebook Twitter LinkedIn More