Real-time Synthesis is Hard! - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Real-time Synthesis is Hard!


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 BResRS subcase is known to be decidable (see D'Souza et al. and Bouyer et al.). In this paper, we precise the decidabil-ity 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 BResRS and introduce an efficient on-the-fly algorithm to solve it.
Fichier principal
Vignette du fichier
main.pdf (253.12 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01344684 , version 1 (19-07-2016)





Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts, Hsi-Ming Ho, Benjamin Monmege, et al.. Real-time Synthesis is Hard!. 14th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS'16), Aug 2016, Québec City, Canada. pp.105-120, ⟨10.1007/978-3-319-44878-7_7⟩. ⟨hal-01344684⟩
290 View
159 Download



Gmail Facebook Twitter LinkedIn More