Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation
Abstract elided by the publisher.
Related papers
- ProbNV: probabilistic verification of network control planes ICFP 2021
- Leveraging Weighted Automata in Compositional Reasoning about Concurrent Probabilistic Systems POPL 2015
- Tensor Probabilistic Model Checking of Finite-Horizon Markov Chains CAV 2026
- Probabilistic Symbolic Model Checking with PRISM: A Hybrid Approach TACAS 2002
- Advances in Symbolic Probabilistic Model Checking with PRISM TACAS 2016
- Fair Termination for Parameterized Probabilistic Concurrent Systems TACAS 2017
- A Conjunctively Decomposed Boolean Representation for Symbolic Model Checking CAV 1996
- Model Checking Finite-Horizon Markov Chains with Probabilistic Inference CAV 2021