Engineering constraint solvers for automatic analysis of probabilistic hybrid automata

Journal of Logic and Algebraic Programming

Volumn 79, Issue 7, 2010, Pages 436-466

  Fränzle, Martin ^a   Teige, Tino ^a   Eggers, Andreas ^a  

^a UNIVERSITY OF OLDENBURG   (Germany)

Author keywords

Arithmetic constraint solving; Bounded model checking; Probabilistic hybrid automata; Stochastic satisfiability

Indexed keywords

AUTOMATA THEORY; DIFFERENTIAL EQUATIONS; DISCRETE TIME CONTROL SYSTEMS; FORMAL LOGIC; HYBRID SYSTEMS; LOGIC PROGRAMMING; MARKOV PROCESSES; ORDINARY DIFFERENTIAL EQUATIONS; STOCHASTIC MODELS; STOCHASTIC SYSTEMS;

ARITHMETIC CONSTRAINTS; BOUNDED MODEL CHECKING; BOUNDED REACHABILITY PROBLEM; DISCRETE-CONTINUOUS SYSTEMS; EXISTENTIAL QUANTIFICATIONS; PROBABILISTIC HYBRID AUTOMATA; SATISFIABILITY MODULO THEORIES; STOCHASTIC SATISFIABILITY;

MODEL CHECKING;

EID: 79959265427     PISSN: 15678326     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jlap.2010.07.003     Document Type: Conference Paper

References (64)

1. E. Ábrahám, B. Becker, F. Klaedke, M. Steffen, Optimizing bounded model checking for linear hybrid systems, in: R. Cousot (Ed.), Proc. of Sixth Int. Conf. on Verification, Model Checking and Abstract Interpretation, VMCAI 2005, Paris, January 2005, Lect. Notes in Comput. Sci, vol. 3385, Springer, 2005, pp. 396-412.
2. E. Ábrahám, T. Schubert, B. Becker,M. Fränzle, C.Herde, Parallel SAT solving in bounded model checking, J. Log.Comput., in press, doi:10.1093/logcom/exp002.
3. S. Amin, A. Abate, M. Prandini, J. Lygeros, S. Sastry, Reachability analysis of controlled discrete-time stochastic hybrid systems, in: J.P. Hespanha, A. Tiwari (Eds.), Proc. of Ninth Int.Wksh. on Hybrid Systems: Computation and Control, HSCC 2006, Santa Barbara, CA,March 2006, LectureNotes in Computer Science, vol. 3927, Springer, 2006, pp. 49-63.
4. L. Arnold, Stochastic Differential Equations: Theory and Applications,Wiley, 1974.
5. G. Audemard, M. Bozzano, A. Cimatti, R. Sebastiani, Verifying industrial hybrid systems with mathsat, in: A. Biere, O. Strichman (Eds.), Proc. of Second Int. Wksh. on Bounded Model-Checking, BMC (Boston, MA, July), Electron. Notes in Theor. Comput. Sci., vol. 119 (2), Elsevier, 2005, pp. 17-32.
6. C. Baier, H. Hermanns, J.-P. Katoen, B.R. Haverkort, Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes, Theor. Comput. Sci. 345 (1) (2005) 2-26.
7. C. Barrett, R. Sebastiani, S.A. Seshia, C. Tinelli, Satisfiability modulo theories, in:A. Biere, M.J.H. Heule, H. vanMaaren, T.Walsh (Eds.),Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol. 185, IOS Press, 2009, pp. 825-885.
8. A. Bauer, M. Pister, M. Tautschnig, Tool-support for the analysis of hybrid systems and models, in: Proc. of 2007 Conf. on Design, Automation and Test in Europe (Nice, April 2007), EDA Consortium, 2007, pp. 924-929.
9. R.J. Bayardo, R. Schrag, Using CSP look-back techniques to solve real-world SAT instances, in: Proc. of 14th Nat. Conf. on Artificial Intelligence and 9th Innovative Applications of Artificial Intelligence Conf. AAAI/'97/IAAI '97 (Providence, RI, July 1997), AAAI Press/The MIT Press, 1997, pp. 203-208.
10. R. Bellman, A Markovian decision process, J. Math. Mech. 6 (1957) 679-684.
11. A. Bemporad, S.D. Cairano, Optimal control of discrete hybrid stochastic automata, in:M. Morari, L. Thiele (Eds.), Proc. of Eighth Int.Wksh. on Hybrid Systems: Computation and Control, HSCC 2005 (Zürich, March 2005), Lecture Notes in Computer Science, vol. 3414, Springer, 2005, pp. 151-167.
12. F. Benhamou, Heterogeneous constraint solving, in: M. Hanus, M. Rodríguez-Artalejo (Eds.), Proc. of 5th Int. Conf. on Algebraic and Logic Programming, ALP '96 (Aachen, September 1996), Lecture Notes in Computer Science, vol. 1139, Springer, 1996, pp. 62-76.
13. F. Benhamou, L. Granvilliers, Continuous and interval constraints, in: F. Rossi, P. van Beek, T.Walsh (Eds.), Handbook of Constraint Programming, Foundations of Artificial Intelligence, Elsevier, 2006, pp. 571-603.
14. F. Benhamou, D. McAllester, P. Van Hentenryck, CLP(intervals) revisited, in: M. Bruynooghe (Ed.), Proc. of 1994 Int. Symp. on Logic Programming, IPLS '94 (Ithaca, NY, November 1994), MIT Press, 1994, pp. 124-138.
15. M. Berz, K. Makino, Verified integration of ODEs and flows using differential algebraic methods on high-order Taylor models, Reliab. Comput. 4 (4) (1998) 361-369.
16. A. Biere, A. Cimatti, E. Clarke, Y. Zhu, Symbolic model checking without BDDs, in: R. Cleaveland (Ed.), Proc. of Fifth Int. Conf. on Tools for Construction and Analysis of Systems, TACAS '99 (Seattle,WA, Aug. 2006), Lecture Notes in Computer Science, vol. 4144, Springer, 2006, pp. 81-94.
17. H.A. Blom, J. Lygeros (Eds.), Stochastic Hybrid Systems: Theory and Safety Critical Applications, Lecture Notes in Control and Information Sciences, vol. 337, Springer, 2006
18. H.A.P. Blom, J. Krystul, G.J. Bakker, A particle system for safety verification of free flight in air traffic, Decision and Control, IEEE, 2006, pp. 1574-1579.
19. M. Bozzano, R. Bruttomesso, A. Cimatti, T.A. Junttila, P. van Rossum, S. Schulz, R. Sebastiani, The MathSAT 3 system, in: R. Nieuwenhuis (Ed.), Proc. of 20th Int. Conf. on Automated Deduction CADE-20 (Tallinn, July 2005), Lecture Notes in Artificial Intelligence, vol. 3632, Springer, 2005, pp. 315-321.
20. M.L. Bujorianu, J. Lygeros, Reachability questions in piecewise deterministic Markov processes, in: O. Maler, A. Pnueli (Eds.), Proc. of Sixth Int. Wksh. on Hybrid Systems: Computation and Control, HSCC 2003 (Prague, April 2003), Lecture Notes in Computer Science, vol. 2623, Springer, 2003, pp. 126-140.
21. M.L. Bujorianu, J. Lygeros, Toward a general theory of stochastic hybrid systems, Stochastic Hybrid Systems: Theory and Safety Critical Applications, Lecture Notes in Control and Information Science, vol. 337, Springer, 2006, pp. 3-30.
22. C.G. Cassandras, J. Lygeros (Eds.), Stochastic Hybrid Systems, CRC Taylor & Francis, 2007.
23. A. Cimatti, M. Pistore, M. Roveri, R. Sebastiani, Improving the encoding of LTL model checking into SAT, in: A. Cortesi (Ed.), Revised Papers from 3rd Int. Wksh. on Verification, Model Checking and Abstract Interpretation VMCAI 2002 (Venice, Jan. 2002), Lecture Notes in Computer Science, vol. 2294, Springer, 2002, pp. 196-207.
24. M.H.A. Davis, Piecewise-deterministic markov processes: a general class of non-diffusion stochastic models, J. Roy. Statist. Soc. 46 (3) (1984) 353-384.
25. M. Davis, Markov Models and Optimization, Chapman and Hall, London, 1993.
26. M. Davis, H. Putnam, A computing procedure for quantification theory, J. ACM 7 (3) (1960) 201-215.
27. M. Davis, G. Logemann, D. Loveland, A machine program for theorem proving, Commun. ACM 5 (1962) 394-397.
28. B. Dutertre, L. de Moura, A fast linear-arithmetic solver for DPLL(T), in: T. Ball, R.B. Jones (Eds.), Proc. of 18th Computer-Aided Verification Conference, CAV 2006 (Seattle,WA, Aug. 2006), Lecture Notes in Computer Science, vol. 4144, Springer, 2006, pp. 81-94.
29. A. Eggers, M. Fränzle, C. Herde, SAT modulo ODE: a direct SAT approach to hybrid systems, in: S.S. Cha, J.-Y. Choi, M. Kim, I. Lee, M. Viswanathan (Eds.), Proc. of Sixth Int. Symp. on Automated Technology for Verification and Analysis, ATVA 2008 (Seoul, October 2008), ATVA, Lect. Notes in Comput. Sci, vol. 5311, Springer, 2008, pp. 171-185.
30. X. Feng, K.A. Loparo, Y. Ji, H.J. Chizeck, Stochastic stability properties of jump linear systems, IEEE Trans. Autom. Control 37 (1) (1992) 38-53.
31. M. Fränzle, C. Herde, HySAT: an efficient proof engine for bounded model checking of hybrid systems, Formal Methods Syst. Design 30 (3) (2007) 179-198.
32. M. Fränzle, C. Herde, T. Teige, S. Ratschan, T. Schubert, Efficient solving of large non-linear arithmetic constraint systems with complex boolean structure, J. Satisfiability, Boolean Model. Comput. 1 (2007) 209-236.
33. M. Fränzle, H. Hermanns, T. Teige, Stochastic satisfiability modulo theory: a novel technique for the analysis of Probabilistic hybrid systems, in:M. Egerstedt, B. Mishra (Eds.), Proc. of 11th Int. Conf. on Hybrid Systems: Computation and Control, HSCC 2008 (St. Louis, MO, April 2008), Lecture Notes in Computer Science, vol. 4981, Springer, 2008, pp. 172-186.
34. A. Girard, Reachability of uncertain linear systems using zonotopes, in: M. Morari, L. Thiele (Eds.), Proc. of Eighth Int.Wksh. on Hybrid Systems: Computation and Control, HSCC 2005 (Zürich, March 2005), Lecture Notes in Computer Science, vol. 3414, Springer, 2005, pp. 291-305.
35. J. Greifeneder, J. Frey, Probabilistic hybrid automata with variable step width applied to the analysis of networked automation systems, in: Proc. of Third IFAC Wksh. on Discrete Event System Design, DESDes '06 (Rydzyna, September 2006), 2006, pp. 283-288.
36. J.F. Groote, J.W.C. Koorn, S.F.M. van Vlijmen, The safety guaranteeing system at Station Hoorn-Kersenboogerd, in: Conf. on Computer Assurance, National Institute of Standards and Technology, 1995, pp. 57-68.
37. E.C.R. Hehner, Predicative programming, Commun. ACM 27 (1984) 134-151.
38. J.P. Hespanha, Polynomial stochastic hybrid systems, in: M. Morari, L. Thiele (Eds.), Proc. of Eighth Int.Wksh. on Hybrid Systems: Computation and Control, HSCC 2005 (Zürich, March 2005), Lecture Notes in Computer Science, vol. 3414, Springer, 2005, pp. 322-338.
39. T.J. Hickey, D.K. Wittenberg, Rigorous modeling of hybrid systems using interval arithmetic constraints, in: R. Alur, G.J. Pappas (Eds.), Proc. of Seventh Int. Wksh. on Hybrid Systems: Computation and Control, HSCC 2004 (Philadelphia, PA, March 2004), Lecture Notes in Computer Science, vol. 2993, Springer, 2004, pp. 402-416.
40. T. Hickey, Q. Ju, M. van Emden, Interval arithmetic: from principles to implementation, J. ACM 48 (5) (2001) 1038-1068.
41. J. Hu, J. Lygeros, S. Sastry, Towards a theory of stochastic hybrid systems, in: N.A. Lynch, B.H. Krogh (Eds.), Proc. of Third Int. Wksh. on Hybrid Systems: Computation and Control, HSCC 2000 (Pittsburgh, PA, March 2000), Lecture Notes in Computer Science, vol. 1790, Springer, 2000, pp. 160-173.
42. X.D. Koutsoukos, D. Riley, Computational methods for reachability analysis of stochastic hybrid systems, in: J.P. Hespanha, A. Tiwari (Eds.), Proc. of 9th Int. Wksh. on Hybrid Systems: Computation and Control, HSCC 2006 (Santa Barbara, CA, March 2006), Lecture Notes in Computer Science, vol. 3927, Springer, 2006, pp. 377-391.
43. M.L. Littman, S.M. Majercik, T. Pitassi, Stochastic Boolean satisfiability, J. Autom. Reason. 27 (3) (2001) 251-296.
44. R. Lohner, Einschließung der Lösung gewöhnlicher Anfangs- und Randwertaufgaben, PhD thesis, Univ. Karlsruhe, 1998.
45. S. Majercik, Nonchronological backtracking in stochastic Boolean satisfiability, Proc. of 16th IEEE Int. Conf. on Tools with Artificial Intelligence, ICTAI 2004 (Boca Raton, FL, Nov. 2004), IEEE CS Press, 2004, pp. 498-507.
46. S.M. Majercik, APPSSAT: approximate probabilistic planning using stochastic satisfiability, Int. J. Approx. Reason. 45 (2) (2007) 402-419.
47. S.M. Majercik, Stochastic Boolean satisfiability, in: A. Biere, M.J.H. Heule, H. van Maaren, T. Walsh (Eds.), Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol. 185, IOS Press, 2009, pp. 887-925.
48. S.M. Majercik, M.L. Littman, MAXPLAN: a new approach to probabilistic planning, in: R.G. Simmons, M.M. Veloso, S. Smith (Eds.), Proc. of 4th Int. Conf. Artificial Intelligence Planning Systems, AIPS '98 (Pittsburgh, PA), AAAI, 1998, pp. 86-93.
49. K. Makino, M. Berz, Suppression of the wrapping effect by Taylor model-based verified integrators: long-term stabilization by preconditioning, Int. J. Differ. Equ. Appl. 10 (4) (2005) 353-384.
50. K. Makino, M. Berz, Suppression of the wrapping effect by Taylor model-based verified integrators: the single step, Int. J. Pure Appl. Math. 36 (2) (2006) 175-197.
51. R.E. Moore, Interval Analysis, Prentice Hall, 1966.
52. R. Moore, Interval Analysis, Prentice-Hall, 1966.
53. N.S. Nedialkov, Interval tools for ODEs and DAEs, Tech. Rep. CAS 06-09-NN, McMaster University, Hamilton, ON, 2006. Available online at 〈http://www.cas.mcmaster.ca/~nedialk/PAPERS/intvtools/intvtools.pdf〉.
54. A. Neumaier, Interval Methods for Systems of Equations, Cambridge University Press, Cambridge, 1990.
55. R. Nieuwenhuis, A. Oliveras, C. Tinelli, Solving SAT and SAT modulo theories: from an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T), J. ACM 53 (6) (2006) 937-977.
56. C.H. Papadimitriou, Games against nature, J. Comput. Syst. Sci. 31 (2) (1985) 288-301.
57. A. Pnueli, The temporal logic of programs, Proc. of 18th Ann. Symp. on Foundations of Computer Science, FOCS '77 (Providence, RI, October-November 1977), IEEE CS Press, 1977, pp. 46-57.
58. D. Riley, X.D. Koutsoukos, K. Riley, Reachability analysis of a biodiesel production systemusing stochastic hybrid systems, in: Proc. of 15th IEEEMediterranean Conf. on Control and Automation, MED '07 (Athens, June 2007), IEEE, 2007, 6 pp.
59. J. Sproston, Model Checking of Probabilistic Timed and Hybrid Systems, PhD thesis, Univ. of Birmingham, 2000.
60. J. Sproston, Decidablemodel checking of probabilistic hybrid automata, in:M. Joseph (Ed.), Proc. of Sixth Int. Symp. on Formal Techniques for Real-Time and Fault-Tolerant Systems, FTRTFT 2000 (Pune, Sept. 2000), Lecture Notes in Computer Science, vol. 1926, Springer, 2000, pp. 31-45.
61. T. Teige, M. Fränzle, Stochastic satisfiability modulo theories for non-linear arithmetic, in: L. Perron, M.A. Trick (Eds.), Proc. of Fifth Int. Conf. on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2008 (Paris, May 2008), Lecture Notes in Computer Science, vol. 5015, Springer, 2008, pp. 248-262.
62. T. Teige, M. Fränzle, Constraint-based analysis of probabilistic hybrid systems, in: A. Giua, C. Mahulea, M. Silva, J. Zaytoon (Eds.), Proc. of Third IFAC Conf. on Analysis and Design of Hybrid Systems, ADHS'09 (Zaragoza, Sept. 2009), IFAC, 2009, pp. 162-167.
63. T. Walsh, Stochastic constraint programming, in: F. van Harmelen (Ed.), Proc. of the 15th Europ. Conf. on Artificial Intelligence, ECAI '02 (Lyon, July 2002), IOS Press, 2002, pp. 111-115.
64. L. Zhang, C.F. Madigan, M.H. Moskewicz, S. Malik, Efficient conflict driven learning in a Boolean satisfiability solver, Proc. of 2001 IEEE/ACM Int. Conf. on Computer-Aided Design, ICCAD '01 (San Jose, CA, November 2001), IEEE, 2001, pp. 279-285.