Stochastic Satisfiability Modulo Theory: A Novel Technique for the Analysis of Probabilistic Hybrid Systems

DMCA

Stochastic Satisfiability Modulo Theory: A Novel Technique for the Analysis of Probabilistic Hybrid Systems (2008)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Martin Fränzle , Holger Hermanns , Tino Teige

Venue:	In Proceedings of the 11th International Conference on Hybrid Systems: Computation and Control (HSCC’08
Citations:	13 - 5 self

BibTeX

@INPROCEEDINGS{Fränzle08stochasticsatisfiability,
    author = {Martin Fränzle and Holger Hermanns and Tino Teige},
    title = {Stochastic Satisfiability Modulo Theory: A Novel Technique for the Analysis of Probabilistic Hybrid Systems},
    booktitle = {In Proceedings of the 11th International Conference on Hybrid Systems: Computation and Control (HSCC’08},
    year = {2008}
}

OpenURL

Abstract

Abstract. The analysis of hybrid systems exhibiting probabilistic behaviour is notoriously difficult. To enable mechanised analysis of such systems, we extend the reasoning power of arithmetic satisfiability-modulotheory solving (SMT) by a comprehensive treatment of randomized (a.k.a. stochastic) quantification over discrete variables within the mixed Booleanarithmetic constraint system. This provides the technological basis for a fully symbolic analysis of probabilistic hybrid automata. Generalizing SMT-based bounded model-checking of hybrid automata [2, 11], stochastic SMT permits the direct and fully symbolic analysis of probabilistic bounded reachability problems of probabilistic hybrid automata without resorting to approximation by intermediate finite-state abstractions. 1

Keyphrases

probabilistic hybrid system stochastic satisfiability modulo theory novel technique probabilistic hybrid automaton symbolic analysis mixed booleanarithmetic constraint system discrete variable technological basis mechanised analysis arithmetic satisfiability-modulotheory solving hybrid system probabilistic bounded reachability problem stochastic smt probabilistic behaviour hybrid automaton smt-based bounded model-checking intermediate finite-state abstraction comprehensive treatment

DMCA