Syntactic LTL obligations translate efficiently to minimal MTBDD-based deterministic weak automata, enabling on-the-fly synthesis with major runtime gains in Spot.
In: Proceedings of the 8th International Sumposium on Games, Automata, Logics and Formal Verification (Gan- dALF’17)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
dataset 1
citation-polarity summary
fields
cs.FL 1years
2026 1verdicts
UNVERDICTED 1roles
dataset 1polarities
use dataset 1representative citing papers
citing papers explorer
-
Fast Obligation Translation and Synthesis
Syntactic LTL obligations translate efficiently to minimal MTBDD-based deterministic weak automata, enabling on-the-fly synthesis with major runtime gains in Spot.