Stochastic Satisfiability Modulo Theory: A Novel Technique for the Analysis of Probabilistic Hybrid Systems
DOI10.1007/978-3-540-78929-1_13zbMath1143.68452OpenAlexW2126053898MaRDI QIDQ3523106
Martin Fränzle, Tino Teige, Holger Hermanns
Publication date: 2 September 2008
Published in: Hybrid Systems: Computation and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78929-1_13
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)
Related Items (10)
Uses Software
Cites Work
- HySAT: An efficient proof engine for bounded model checking of hybrid systems
- Solving SAT and SAT Modulo Theories
- Predicative programming Part I
- A machine program for theorem-proving
- Hybrid Systems: Computation and Control
- Hybrid Systems: Computation and Control
- Stochastic Boolean satisfiability
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Stochastic Satisfiability Modulo Theory: A Novel Technique for the Analysis of Probabilistic Hybrid Systems