Skip to Main content Skip to Navigation
Conference papers

Analysing Decisive Stochastic Processes

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Nathalie Bertrand Connect in order to contact the contributor
Submitted on : Wednesday, November 16, 2016 - 12:07:37 PM
Last modification on : Thursday, January 20, 2022 - 4:16:17 PM
Long-term archiving on: : Thursday, March 16, 2017 - 6:28:37 PM


Publisher files allowed on an open archive



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⟩



Record views


Files downloads