Weakly acyclic diagrams generalize OBDDs to infinite weakly acyclic languages while retaining top-down memoized algorithms and canonical representations.
In: Model Checking, Synthesis, and Learning – Essays Dedicated to Bengt Jonsson on The Occasion of His 60th Birthday
1 Pith paper cite this work, alongside 2 external citations. Polarity classification is still indexing.
1
Pith paper citing it
2
external citations · OpenAlex
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.