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 31st International Conference on Automated Planning and Scheduling (ICAPS’21)
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Gray-box operators enable RLS to achieve expected O(n log n) runtime for proper 2-colorings in bipartite graphs, unlike standard (1+1) EA which requires plateau guidance.
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.
-
Gray-Box Optimization and the Vertex Coloring Problem
Gray-box operators enable RLS to achieve expected O(n log n) runtime for proper 2-colorings in bipartite graphs, unlike standard (1+1) EA which requires plateau guidance.