2020/01/31 by Patricia Bouyer, Thomas Brihaye, Mickael Randour +2 · 1 citation
Computer Science · Engineering · Mathematics · #cs.LO #cs.FL #cs.SY #eess.SY #math.PR
paper · pdf · doi:10.4204/eptcs.326.10
published as EPTCS 326, 2020, pp. 149-165 · In Proceedings GandALF 2020, arXiv:2009.09360
arxiv created 2020/09/23 · arxiv updated 2020/09/24
In [ABM07], Abdulla et al. introduced the concept of decisiveness, an interesting tool for lifting good properties of finite Markov chains to denumerable ones. Later, this concept was extended to more general stochastic transition systems (STSs), allowing the design of various verification algorithms for large classes of (infinite) STSs. We further improve the understanding and utility of decisiveness in two ways. First, we provide a general criterion for proving decisiveness of general STSs. This criterion, which is very natural but whose proof is rather technical, (strictly) generalizes all known criteria from the literature. Second, we focus on stochastic hybrid systems (SHSs), a stochastic extension of hybrid systems. We establish the decisiveness of a large class of SHSs and, under a few classical hypotheses from mathematical logic, we show how to decide reachability problems in this class, even though they are undecidable for general SHSs. This provides a decidable stochastic extension of o-minimal hybrid systems. [ABM07] Parosh A. Abdulla, Noomene Ben Henda, and Richard Mayr. 2007. Decisive Markov Chains. Log. Methods Comput. Sci. 3, 4 (2007).