Generating BDD Models for Process Algebra Terms
Abstract elided by the publisher.
Related papers
- Generating BDDs for Symbolic Model Checking in CCS CAV 1991
- Symbolic Model Checking without BDDs TACAS 1999
- Imprecise Probabilistic Programming, Precisely: Credal Sets via Graded Monads, BDDs, and Semiring-Parametric Inference (Functional Pearl) ICFP 2026
- Versatile event correlation with algebraic effects ICFP 2018
- Dynamic Programming for Symbolic Boolean Realizability and Synthesis CAV 2024
- A BDD-Based Model Checker for Recursive Programs CAV 2001
- BDD vs. Constraint-Based Model Checking: An Experimental Evaluation for Asynchronous Concurrent Systems TACAS 2000
- Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests POPL 2015