PASS: Abstraction Refinement for Infinite Probabilistic Models

Conference item

We present PASS, a tool that analyzes concurrent probabilistic programs, which map to potentially infinite Markov decision processes. PASS is based on predicate abstraction and abstraction refinement and scales to programs far beyond the reach of numerical methods which operate on the full state space of the model. The computational engines we use are SMT solvers to compute finite abstractions, numerical methods to compute probabilities and interpolation as part of abstraction refinement. sf PASS has been successfully applied to network protocols and serves as a test platform for different refinement methods

Authors: Hahn, E; Hermanns, H; Wachter, B; Zhang, L

• Host title: TACAS
• Publication date: 2010-01-01
• DOI: 10.1007/978-3-642-12002-2_30
• ISSN: 0302-9743