Syntactic LTL obligations translate efficiently to minimal MTBDD-based deterministic weak automata, enabling on-the-fly synthesis with major runtime gains in Spot.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 2polarities
background 2representative citing papers
SCAN algorithm extended to compute witnesses for second-order quantifiers alongside quantifier elimination on clause sets.
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.
-
Computing Witnesses Using the SCAN Algorithm
SCAN algorithm extended to compute witnesses for second-order quantifiers alongside quantifier elimination on clause sets.