Real-Time Synthesis is Hard!
Logic in Computer Science
2016-06-24 v1 Formal Languages and Automata Theory
Abstract
We study the reactive synthesis problem (RS) for specifications given in Metric Interval Temporal Logic (MITL). RS is known to be undecidable in a very general setting, but on infinite words only; and only the very restrictive BRRS subcase is known to be decidable (see D'Souza et al. and Bouyer et al.). In this paper, we precise the decidability border of MITL synthesis. We show RS is undecidable on finite words too, and present a landscape of restrictions (both on the logic and on the possible controllers) that are still undecidable. On the positive side, we revisit BRRS and introduce an efficient on-the-fly algorithm to solve it.
Cite
@article{arxiv.1606.07124,
title = {Real-Time Synthesis is Hard!},
author = {Thomas Brihaye and Morgane Estiévenart and Gilles Geeraerts and Hsi-Ming Ho and Benjamin Monmege and Nathalie Sznajder},
journal= {arXiv preprint arXiv:1606.07124},
year = {2016}
}