Weakly acyclic diagrams generalize OBDDs to infinite weakly acyclic languages while retaining top-down memoized algorithms and canonical representations.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Weakly acyclic diagrams: A data structure for infinite-state symbolic verification
Weakly acyclic diagrams generalize OBDDs to infinite weakly acyclic languages while retaining top-down memoized algorithms and canonical representations.