Constraint-based analysis of concurrent probabilistic hybrid systems: An application to networked automation systems

Nonlinear Analysis: Hybrid Systems

Volumn 5, Issue 2, 2011, Pages 343-366

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

^a UNIVERSITY OF OLDENBURG   (Germany)

Author keywords

Automatic verification; Concurrent probabilistic hybrid systems; Constraint satisfaction problems; Probabilistic logic; Problem solvers

Indexed keywords

AUTOMATIC VERIFICATION; AUTOMATION SYSTEMS; BOUNDED REACHABILITY PROBLEM; COMPUTATIONAL MODEL; CONCURRENT PROBABILISTIC HYBRID SYSTEMS; CONSTRAINT SATISFACTION PROBLEMS; CONSTRAINT-BASED ANALYSIS; FORMAL MODEL; MODELING LANGUAGES; PROBABILISTIC AUTOMATA; PROBABILISTIC HYBRID AUTOMATA; PROBLEM SOLVERS; PROPOSITIONAL SATISFIABILITY; QUANTITATIVE ANALYSIS; REACHABILITY ANALYSIS; SATISFIABILITY MODULO THEORIES; SOLVING ALGORITHM; STOCHASTIC SATISFIABILITY; SYMBOLIC ANALYSIS; SYMBOLIC METHODS; TRANSLATION SCHEMES;

ALGORITHMS; AUTOMATA THEORY; AUTOMATION; EMBEDDED SYSTEMS; ENCODING (SYMBOLS); HYBRID COMPUTERS; HYBRID SYSTEMS; STOCHASTIC SYSTEMS;

PROBABILISTIC LOGICS;

EID: 79953228393     PISSN: 1751570X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.nahs.2010.04.009     Document Type: Article

References (32)

1. J.F. Groote, J.W.C. Koorn, S.F.M. van Vlijmen, The Safety Guaranteeing System at Station Hoorn-Kersenboogerd, in: Conference on Computer Assurance, National Institute of Standards and Technology, 1995, pp. 57-68.
2. Biere A., Cimatti A., Clarke E.M., Zhu Y. Symbolic model checking without BDDs. Lecture Notes in Computer Science 1999, vol. 1579:193-207. Springer. R. Cleaveland (Ed.).
3. Bozzano M., Bruttomesso R., Cimatti A., Junttila T.A., van Rossum P., Schulz S., Sebastiani R. The MathSAT 3 system. Lecture Notes in Computer Science 2005, vol. 3632:315-321. Springer Verlag.
4. Dutertre B., de Moura L. A Fast Linear-Arithmetic Solver for DPLL(T). Lecture Notes in Computer Science 2006, vol. 4144:81-94. Springer-Verlag.
5. A. Bauer, M. Pister, M. Tautschnig, Tool-support for the analysis of hybrid systems and models, in: DATE '07: Proceedings of the Conference on Design, Automation and Test in Europe, EDA Consortium, San Jose, CA, USA, 2007, pp. 924-929.
6. Fränzle M., Herde C., Teige T., Ratschan S., Schubert T. Efficient solving of large non-linear arithmetic constraint systems with complex boolean structure. Journal on Satisfiability, Boolean Modeling and Computation 2007, 1:209-236. Special Issue on SAT/CP Integration.
7. Audemard G., Bozzano M., Cimatti A., Sebastiani R. Verifying industrial hybrid systems with mathsat. Electronic Notes in Theoretical Computer Science 2005, 119(2):17-32.
8. Fränzle M., Herde C. HySAT: An efficient proof engine for bounded model checking of hybrid systems. Formal Methods in System Design 2007, 30:179-198.
9. Ábrahám E., Becker B., Klaedke F., Steffen M. Optimizing bounded model checking for linear hybrid systems. Lecture Notes in Computer Science 2005, vol. 3385:396-412. Springer-Verlag, Paris, an extended version of this paper appeared as ATR 4.
10. E. Ábrahám, T. Schubert, B. Becker, M. Fränzle, C. Herde, Parallel SAT solving in bounded model checking, Journal of Logic and Computation, URL: http://dx.doi.org/10.1093/logcom/exp002.
11. Eggers A., Fränzle M., Herde C. SAT modulo ODE: a direct SAT approach to hybrid systems. Lecture Notes in Computer Science 2008, vol. 5311:171-185. Springer. S.S. Cha, J.-Y. Choi, M. Kim, I. Lee, M. Viswanathan (Eds.).
12. Fränzle M., Hermanns H., Teige T. Stochastic satisfiability modulo theory: a novel technique for the analysis of probabilistic hybrid systems. LNCS 2008, vol. 4981:172-186. Springer. M. Egerstedt, B. Mishra (Eds.).
13. Teige T., Fränzle M. Stochastic satisfiability modulo theories for non-linear arithmetic. LNCS 2008, vol. 5015:248-262. Springer. L. Perron, M.A. Trick (Eds.).
14. Papadimitriou C.H. Games against nature. Journal of Computer and System Sciences 1985, 31(2):288-301.
15. Littman M.L., Majercik S.M., Pitassi T. Stochastic Boolean Satisfiability. Journal of Automated Reasoning 2001, 27(3):251-296.
16. S. Majercik, Nonchronological backtracking in stochastic Boolean satisfiability, in: Tools with Artificial Intelligence, 2004. ICTAI 2004. 16th IEEE International Conference on, IEEE Computer Society, 2004, pp. 498-507. doi:10.1109/ICTAI.2004.94.
17. Majercik S.M. APPSSAT: Approximate probabilistic planning using stochastic satisfiability. International Journal of Approximate Reasoning 2007, 45(2):402-419.
18. M. Fränzle, T. Teige, A. Eggers, Engineering constraint solvers for automatic analysis of probabilistic hybrid automata, The Journal of Logic and Algebraic Programming (2010) (in press).
19. J. Sproston, Model checking of probabilistic timed and hybrid systems, Ph.D. Thesis, University of Birmingham, 2000.
20. Bemporad A., Cairano S.D. Optimal control of discrete hybrid stochastic automata. Lecture Notes in Computer Science 2005, vol. 3414:151-167. Springer.
21. Davis M. Markov Models and Optimization 1993, Chapman & Hall, London.
22. Arnold L. Stochastic Differential Equations: Theory and Applications 1974, Wiley - Interscience.
23. Hu J., Lygeros J., Sastry S. Towards a theory of stochastic hybrid systems. Lecture Notes in Computer Science 2000, vol. 1790:160-173. Springer-Verlag.
24. Bujorianu M.L., Lygeros J. Toward a general theory of stochastic hybrid systems. Lecture Notes in Control and Information Sciences 2006, vol. 337:3-30. Springer-Verlag.
25. C. Barrett, R. Sebastiani, S.A. Seshia, C. Tinelli, Satisfiability modulo theories, in: Biere et al. [27], Ch. 26, pp. 825-885.
26. Hoare C.A.R. Communicating Sequential Processes, Series in Computer Science 1985, Prentice-Hall Intl.
27. Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications 2009, vol. 185. IOS Press. A. Biere, M.J.H. Heule, H. van Maaren, T. Walsh (Eds.).
28. Benhamou F., Granvilliers L. Continuous and interval constraints. Foundations of Artificial Intelligence 2006, 571-603. Elsevier, Amsterdam, (Chapter 16). F. Rossi, P. van Beek, T. Walsh (Eds.).
29. S.M. Majercik, Stochastic Boolean satisfiability, in: Biere et al. [27], Ch. 27, pp. 887-925.
30. Majercik S.M., Littman M.L. MAXPLAN: A New Approach to Probabilistic Planning. Artificial Intelligence Planning Systems 1998, 86-93.
31. J. Greifeneder, G. Frey, Probabilistic hybrid automata with variable step width applied to the analysis of networked automation systems, in: Proc. 3rd IFAC Workshop on Discrete Event System Design, DESDes'06, IFAC, 2006, pp. 283-288.
32. Lewis M.D.T., Marin P., Schubert T., Narizzano M., Becker B., Giunchiglia E. PaQuBE: Distributed QBF solving with advanced knowledge sharing. Lecture Notes in Computer Science 2009, vol. 5584:509-523. Springer. O. Kullmann (Ed.).