Safety verification for probabilistic hybrid systems

European Journal of Control

Volumn 18, Issue 6, 2012, Pages 572-587

  Zhang, Lijun ^a   She, Zhikun ^b   Ratschan, Stefan ^c   Hermanns, Holger ^d   Hahn, Ernst Moritz ^d  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

^b BEIHANG UNIVERSITY   (China)

^c INSTITUTE OF MATHEMATICS   (Czech Republic)

^d SAARLAND UNIVERSITY   (Germany)

Author keywords

Abstraction refinement; Hybrid system Probabilistic; Safety

Indexed keywords

ABSTRACTING; CONTINUOUS TIME SYSTEMS; STOCHASTIC SYSTEMS;

ABSTRACTION-REFINEMENT; CONTINUOUS DYNAMICS; CONTROL APPLICATIONS; HYBRID SYSTEM PROBABILISTIC; PROBABILISTIC VARIANT; PROBABILISTICS; SAFETY VERIFICATION; SENSING APPLICATIONS; WIRELESS CONTROL; WIRELESS SENSING;

HYBRID SYSTEMS;

EID: 84874590818     PISSN: 09473580     EISSN: None     Source Type: Journal    
DOI: 10.3166/EJC.18.572-587     Document Type: Article

References (34)

1. Abate A, Prandini M, Lygeros J, Sastry S. Probabilistic reachability and safety for controlled discrete time stochastic hybrid systems. Automatica, 2008; 44(11): 2724-2734.
2. Altman E, Gaitsgory V. Asymptotic optimization of a nonlinear hybrid system governed by a Markov decision process. SIAM J Control Optim, 1997; 35(6): 2070-2085.
3. Alur R, Courcoubetis C, Halbwachs N, Henzinger TA, Ho P-H, Nicollin X, Olivero A, Sifakis J, Yovine S. The algorithmic analysis of hybrid systems. Theor Comput Sci, 1995; 138(1): 3-34.
4. Alur R, Dang T, Ivancic F. Predicate abstraction for reachability analysis of hybrid systems. ACM Trans Embedded Comput Syst, 2006; 5(1): 152-199.
5. Arnold L. Stochastic Differential Equations: Theory and Applications, Wiley Interscience, New York, 1974.
6. Bertsekas D. Dynamic Programming and Optimal Control, Vol. 2, Athena Scientific, Belmont, Massachusetts, 1995.
7. Bianco A, de Alfaro L. Model checking of probabilistic and nondeterministic systems. In Thiagarajan PS (editor), Foundations of Software Technology and Theoretical Computer Science (FSTTCS), Lecture Notes in Computer Science (LNCS), Vol. 1026, Springer, Berlin/Heidelberg, pp. 499-513, 1995.
8. Blom H, Lygeros J. Stochastic Hybrid Systems: Theory and Safety Critical Applications, Lecture Notes in Control and Information Sciences (LNCIS), Vol. 337, Springer, Berlin/Heidelberg, 2006.
9. Bujorianu ML. Extended stochastic hybrid systems and their reachability problem. In Alur R, Pappas G J (editors), Hybrid Systems: Computation and Control (HSCC), Lecture Notes in Computer Science (LNCS), Vol. 2993, Springer, Berlin/Heidelberg, pp. 234-249, 2004.
10. Bujorianu ML, Lygeros J. Toward a general theory of stochastic hybrid systems. In Blom and Lygeros [8], pp. 3-30.
11. Bujorianu ML, Lygeros J, Bujorianu MC. Bisimulation for general stochastic hybrid systems. In Morari M, Thiele L (editors), Hybrid Systems: Computation and Control (HSCC), Lecture Notes in Computer Science (LNCS), Vol. 3414, Springer, Berlin/Heidelberg, pp. 198-214, 2005.
12. Bujorianu ML, Lygeros J, Langerak R. Reachability analysis of stochastic hybrid systems by optimal control. In Egerstedt M, Mishra B (editors), Hybrid Systems: Computation and Control (HSCC), Lecture Notes in Computer Science (LNCS), Vol. 4981, Springer, Berlin/Heidelberg, pp. 610-613, 2008.
13. Clarke E, Fehnker A, Han Z, Krogh B, StursbergO, Theobald M. Verification of hybrid systems based on counterexampleguided abstraction refinement. In Garavel H, Hatcliff J (editors), Tools and Algorithms for the Construction and Analysis of Systems (TACAS), Lecture Notes in Computer Science (LNCS), Vol. 2619, Springer, Berlin/Heidelberg, pp. 192-207, 2003.
14. D'Argenio PR, Jeannet B, Jensen HE, Larsen KG. Reachability analysis of probabilistic systems by successive refinements. In de Alfaro L, Gilmore S (editors), Process Algebra and Probabilistic Methods, Performance Modeling and Verification: Joint InternationalWorkshop (PAPM-PROBMIV), Lecture Notes in Computer Science (LNCS), Vol. 2165, Springer, Berlin/Heidelberg, pp. 39-56, 2001.
15. Davis MHA. Piecewise-deterministic Markov processes: A general class of non-diffusion stochastic models. J R Stat Soc, 1984; 46(3): 353-388.
16. Fränzle M, Hermanns H, Teige T. Stochastic satisfiability modulo theory: A novel technique for the analysis of probabilistic hybrid systems. In Egerstedt M, Mishra B (editors), Hybrid Systems: Computation and Control (HSCC), Lecture Notes in Computer Science (LNCS), Vol. 4981, Springer, Berlin/Heidelberg, pp. 172-186, 2008.
17. Frehse G. PHAVer: Algorithmic verification of hybrid systems past HyTech. In Morari M, Thiele L (editors), Hybrid Systems: Computation and Control (HSCC), Lecture Notes in Computer Science (LNCS), Vol. 3414, Springer, Berlin/Heidelberg, pp. 258-273, 2005.
18. Henzinger TA, Kopke PW, Puri A, Varaiya P. What's decidable about hybrid automata. J Comput Syst Sci, 1998; 57: 94-124.
19. Hermanns H, Wachter B, Zhang L. Probabilistic CEGAR. In Gupta A, Malik S (editors), Computer-Aided Verification (CAV), Lecture Notes in Computer Science (LNCS), Vol. 5123, Springer, Berlin/Heidelberg, pp. 162-175, 2008.
20. Hu J, Lygeros J, Sastry S. Towards a theory of stochastic hybrid systems. In Lynch NA, Krogh BH (editors), Hybrid Systems: Computation and Control (HSCC), Lecture Notes in Computer Science (LNCS), Vol. 1790, Springer, Berlin/Heidelberg, pp. 160-173, 2005.
21. Jonsson B, Larsen KG. Specification and refinement of probabilistic processes. IEEE Symposium on Logic in Computer Science (LICS), IEEE Computer Society, pp. 266-277, 1991.
22. Julius AA. Approximate abstraction of stochastic hybrid automata. In Hespanha JP, Tiwari A (editors), Hybrid Systems: Computation and Control (HSCC), Lecture Notes in Computer Science (LNCS), Vol. 3927, Springer, Berlin/Heidelberg, pp. 318-332, 2006.
23. Julius AA, Pappas GJ. Approximations of stochastic hybrid systems. IEEE Trans Autom Control, 2009; 54(6): 1193-1203.
24. Kwiatkowska M, Norman G, Parker D. Stochastic Games for verification of probabilistic timed automata. In Ouaknine J, Vaandrager FW (editors), Int'l Conf. on Formal Modeling and Analysis of Timed Systems (FORMATS), Lecture Notes in Computer Science (LNCS), Vol. 5813, Springer, Berlin/Heidelberg, pp. 212-227, 2009.
25. Kwiatkowska MZ, Norman G, Segala R, Sproston J. Automatic verification of real-time systems with discrete probability distributions. Theor Comput Sci, 2002; 282(1): 101-150.
26. Lafferriere G, Pappas GJ, Yovine S. A new class of decidable hybrid systems. In Vaandrager FW, van Schuppen JH (editors), Hybrid Systems: Computation and Control (HSCC), Lecture Notes in Computer Science (LNCS), Vol. 1569, Springer, Berlin/Heidelberg, pp. 137-151, 1999.
27. Preußig J, Kowalewski S, Wong-Toi H, Henzinger TA. An algorithm for the approximative analysis of rectangular automata. In Ravn AP, Rischel H (editors), Formal Techniques in Real-Time and Fault Tolerant System (FTRTFT), Lecture Notes in Computer Science (LNCS), Vol. 1486, Springer, Berlin/Heidelberg, pp. 228-240, 1998.
28. Puterman ML. Markov Decision Processes: Discrete Stochastic Dynamic Programming, John Wiley & Sons, Hoboken, New Jersey, 1994.
29. Ratschan S. Safety verification of non-linear hybrid systems is quasi-semidecidable. TAMC 2010: 7th Annual Conference on Theory and Applications of Models of Computation, LNCS, Vol. 6108, Springer, Berlin, Heidelberg, pp. 397-408, 2010.
30. Ratschan S, She Z. Safety verification of hybrid systems by constraint propagation-based abstraction refinement. ACM Trans Embedded Comput Syst, 2007; 6(1): article No. 8, pp. 1-23.
31. Segala R, Lynch N. Probabilistic simulations for probabilistic processes. J Comput (NJC), 1995; 2(2): 250-273.
32. Sproston J. Decidable model checking of probabilistic hybrid automata. In Joseph M (editor), Formal Techniques in Real-Time and Fault Tolerant System (FTRTFT), Lecture Notes in Computer Science (LNCS), Vol. 1926, Springer, Berlin/Heidelberg, pp. 31-45, 2000.
33. Teige T, Fränzle M. Constraint-based analysis of probabilistic hybrid systems. In Giua A, Mahulea C, SilvaM, Zaytoon J (editors), Analysis and Design of Hybrid Systems (ADHS), IFAC, pp. 162-167, 2009.
34. Zhang L, She Z, Ratschan S, Hermanns H, Hahn EM. Safety verification for probabilistic hybrid systems. In Touili T, Cook B, Jackson P (editors), Computer-Aided Verification (CAV), Lecture Notes in Computer Science (LNCS), Vol. 6174, Springer, Berlin/Heidelberg, pp. 196-211, 2010.