Syntactic LTL obligations translate efficiently to minimal MTBDD-based deterministic weak automata, enabling on-the-fly synthesis with major runtime gains in Spot.
In: Hung, D.V., Sokolsky, O
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.FL 2years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Extends QuAK with flattening procedures that reduce nested quantitative automata to quantitative automata while preserving answers to threshold decision problems for known decidable cases.
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.
-
Extending QuAK with Nested Quantitative Automata
Extends QuAK with flattening procedures that reduce nested quantitative automata to quantitative automata while preserving answers to threshold decision problems for known decidable cases.