Synthesizing Structured Reactive Programs via Deterministic Tree Automata
Abstract
Existing approaches to the synthesis of reactive systems typically involve the construction of transition systems such as Mealy automata. However, in order to obtain a succinct representation of the desired system, structured programs can be a more suitable model. In 2011, Madhusudan proposed an algorithm to construct a structured reactive program for a given omegaregular specification without synthesizing a transition system first. His procedure is based on twoway alternating omegaautomata on finite trees that recognize the set of "correct" programs. We present a more elementary and direct approach using only deterministic bottomup tree automata that compute socalled signatures for a given program. In doing so, we extend Madhusudan's results to the wider class of programs with bounded delay, which may read several input symbols before producing an output symbol (or vice versa). As a formal foundation, we inductively define a semantics for such programs.
 Publication:

arXiv eprints
 Pub Date:
 March 2013
 DOI:
 10.48550/arXiv.1303.0797
 arXiv:
 arXiv:1303.0797
 Bibcode:
 2013arXiv1303.0797B
 Keywords:

 Computer Science  Logic in Computer Science
 EPrint:
 In Proceedings SR 2013, arXiv:1303.0071