On Application of Multi-Rooted Binary Decision Diagrams to Probabilistic Model Checking
Abstract elided by the publisher.
Related papers
- Leveraging Weighted Automata in Compositional Reasoning about Concurrent Probabilistic Systems POPL 2015
- Compositional Probabilistic Model Checking with String Diagrams of MDPs CAV 2023
- Combining Decision Diagrams and SAT Procedures for Efficient Symbolic Model Checking CAV 2000
- Weakly Acyclic Diagrams: A Data Structure for Infinite-State Symbolic Verification TACAS 2025
- FeynmanDD: Quantum Circuit Analysis with Classical Decision Diagrams CAV 2025
- Chain Reduction for Binary and Zero-Suppressed Decision Diagrams TACAS 2018
- Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests POPL 2015
- Using Datalog with Binary Decision Diagrams for Program Analysis APLAS 2005