The Extended HOA Format for Synthesis
Logic in Computer Science
2020-05-14 v2 Formal Languages and Automata Theory
Abstract
We propose a small extension to the Hanoi Omega-Automata format to define reactive-synthesis problems. Namely, we add a "controllable-AP" header item specifying the subset of atomic propositions which is controllable. We describe the semantics of the new format and propose an output format for synthesized strategies. Finally, we also comment on tool support meant to encourage fast adoption of the extended Hanoi Omega-Automata format for synthesis.
Cite
@article{arxiv.1912.05793,
title = {The Extended HOA Format for Synthesis},
author = {Guillermo A. Perez},
journal= {arXiv preprint arXiv:1912.05793},
year = {2020}
}
Comments
Updated the link to a cited tool and made it explicit that parity automata can be assumed to be complete