Satisfaction Meets Expectations - Computing Expected Values of Probabilistic Hybrid Systems with SMT

Stochastic satisfiability modulo theories (SSMT), which is an extension of satisfiability modulo theories with randomized quantification, has successfully been used as a symbolic technique for computing reachability probabilities in probabilistic hybrid systems. Motivated by the fact that several industrial applications call for quantitative measures that go beyond mere reachability probabilities, this paper extends SSMT to compute expected values of probabilistic hybrid systems like, e.g., mean-times to failure. Practical applicability of the proposed approach is demonstrated by a case study from networked automation systems.

[1]  Martin Fränzle,et al.  Stochastic Satisfiability Modulo Theory: A Novel Technique for the Analysis of Probabilistic Hybrid Systems , 2008, HSCC.

[2]  Martin Fränzle,et al.  Efficient Solving of Large Non-linear Arithmetic Constraint Systems with Complex Boolean Structure , 2007, J. Satisf. Boolean Model. Comput..

[3]  Toby Walsh,et al.  Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications , 2009 .

[4]  Lijun Zhang,et al.  Safety Verification for Probabilistic Hybrid Systems , 2010, Eur. J. Control.

[5]  Toniann Pitassi,et al.  Stochastic Boolean Satisfiability , 2001, Journal of Automated Reasoning.

[6]  Georg Frey,et al.  PROBABILISTIC HYBRID AUTOMATA WITH VARIABLE STEP WIDTH APPLIED TO THE ANAYLSIS OF NETWORKED AUTOMATION SYSTEMS , 2006 .

[7]  Cesare Tinelli,et al.  Satisfiability Modulo Theories , 2021, Handbook of Satisfiability.

[8]  Martin Fränzle,et al.  Constraint-based analysis of concurrent probabilistic hybrid systems: An application to networked automation systems ☆ , 2011 .

[9]  Martin Fränzle,et al.  Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic , 2008, CPAIOR.

[10]  Christos H. Papadimitriou,et al.  Games against nature , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[11]  Toby Walsh,et al.  Handbook of satisfiability , 2009 .

[12]  Laurence A. Wolsey,et al.  Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007, Proceedings , 2007, CPAIOR.

[13]  Thomas A. Henzinger,et al.  Hybrid Systems: Computation and Control , 1998, Lecture Notes in Computer Science.