Decisiveness of stochastic systems and its application to hybrid models

In [1], Abdulla et al. introduced the concept of decisiveness, an interesting tool for lifting good properties of finite Markov chains to denumerable ones. Later [2], 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 the 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 [3, 4, 5].

[1]  Christel Baier,et al.  Composition of Stochastic Transition Systems Based on Spans and Couplings , 2016, ICALP.

[2]  Jianghai Hu,et al.  Application of Reachability Analysis for Stochastic Hybrid Systems to Aircraft Conflict Prediction , 2008, IEEE Transactions on Automatic Control.

[3]  Nathalie Bertrand,et al.  Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics , 2008, 2008 Fifth International Conference on Quantitative Evaluation of Systems.

[4]  Raffaella Gentilini.  Reachability Problems on Extended O-Minimal Hybrid Automata , 2005, FORMATS.

[5]  A. Wilkie.  Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function , 1996 .

[6]  Thomas A. Henzinger,et al.  Robust Undecidability of Timed and Hybrid Systems , 2000, HSCC.

[7]  Joost-Pieter Katoen,et al.  Approximate Model Checking of Stochastic Hybrid Systems , 2010, Eur. J. Control.

[8]  Lorenzo Ridi,et al.  Transient analysis of non-Markovian models using stochastic state classes , 2012, Perform. Evaluation.

[9]  Tobias Kaiser.  First order tameness of measures , 2012, Ann. Pure Appl. Log..

[10]  Parosh Aziz Abdulla,et al.  Decisive Markov Chains , 2007, Log. Methods Comput. Sci..

[11]  Thomas A. Henzinger,et al.  The Algorithmic Analysis of Hybrid Systems , 1995, Theor. Comput. Sci..

[12]  John Lygeros,et al.  Towars a Theory of Stochastic Hybrid Systems , 2000, HSCC.

[13]  Christel Baier,et al.  Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata , 2008, 2008 23rd Annual IEEE Symposium on Logic in Computer Science.

[14]  Edward R. Dougherty,et al.  Review of stochastic hybrid systems with applications in biological systems modeling and analysis , 2017, EURASIP J. Bioinform. Syst. Biol..

[15]  Alessandro Berarducci.  An additive measure in o-minimal expansions of fields , 2004 .

[16]  Patricia Bouyer,et al.  Decisiveness of Stochastic Systems and its Application to Hybrid Models , 2020, GandALF.

[17]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[18]  John Lygeros,et al.  Stochastic Hybrid Systems: A Powerful Framework for Complex, Large Scale Applications , 2010, Eur. J. Control.

[19]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

[20]  Christel Baier,et al.  Stochastic Timed Automata , 2014, Log. Methods Comput. Sci..

[21]  Ursula Dresdner,et al.  Computation Finite And Infinite Machines , 2016 .

[22]  Rick Durrett.  Probability , 2019 .

[23]  C. Cassandras,et al.  Stochastic hybrid systems , 2006 .

[24]  Thomas Brihaye,et al.  On O-Minimal Hybrid Systems , 2004, HSCC.

[25]  Angus Macintyre,et al.  On the decidability of the real exponential field , 1996 .

[26]  Nancy A. Lynch,et al.  Hybrid Systems: Computation and Control , 2002, Lecture Notes in Computer Science.

[27]  Nathalie Bertrand,et al.  When are Stochastic Transition Systems Tameable? , 2017, J. Log. Algebraic Methods Program..

[28]  João Pedro Hespanha,et al.  Stochastic Hybrid Systems: Application to Communication Networks , 2004, HSCC.

[29]  L. M. Bujorianu,et al.  Stochastic Reachability Analysis of Hybrid Systems , 2012 .

[30]  John Lygeros,et al.  A probabilistic approach to aircraft conflict detection , 2000, IEEE Trans. Intell. Transp. Syst..

[31]  Thomas A. Henzinger,et al.  The theory of hybrid automata , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[32]  J. K. Hunter,et al.  Measure Theory , 2007 .

[33]  Christel Baier,et al.  Principles of model checking , 2008 .

[34]  Laurent Fribourg,et al.  Formal Modeling and Analysis of Timed Systems , 2013, Lecture Notes in Computer Science.

[35]  Enrico Vicario,et al.  Probabilistic Model Checking of Regenerative Concurrent Systems , 2016, IEEE Transactions on Software Engineering.

[36]  Kim G. Larsen,et al.  Statistical Model Checking for Stochastic Hybrid Systems , 2012, HSB.

[37]  A. Pillay,et al.  Definable sets in ordered structures , 1984 .

[38]  Patricia Bouyer,et al.  Updatable timed automata , 2004, Theor. Comput. Sci..

[39]  Pravin Varaiya,et al.  What's decidable about hybrid automata? , 1995, STOC '95.

[40]  A. Tarski.  A Decision Method for Elementary Algebra and Geometry , 2023 .

[41]  Abhyudai Singh,et al.  Stochastic hybrid systems for studying biochemical processes , 2010, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[42]  George J. Pappas,et al.  Hybrid Systems: Computation and Control , 2004, Lecture Notes in Computer Science.

[43]  John Lygeros,et al.  Probabilistic reachability and safety for controlled discrete time stochastic hybrid systems , 2008, Autom..