Download PDFOpen PDF in browserBlinking Synthesis18 pages•Published: October 23, 2026AbstractReactive systems interact with their environment and have to satisfy their specifications in all environments also in settings with partial visibility. Researchers have extensively studied settings in which assignments to some input signals are hidden throughout the interaction. We introduce and study blinking synthesis – synthesis in settings in which the assignment to all input signals is hidden in some rounds of the interaction. Blinking synthesis is relevant for systems with sensor failures, communication disruptions, or scheduling constraints.The input to the blinking synthesis problem includes, in addition to a specification language L_φ over the input and output signals, also a hiding language L_H, describing behaviors that trigger hiding of input signals. The goal is to generate a system that satisfies L_φ in all environments that hide the assignment to input signals whenever the computation so far is in L_H. We show that while for LTL specifications the problem is 2EXPTIME-complete, a careful and parameterized analysis reveals it is harder than LTL synthesis: blinking synthesis of EXPTIME-complete for specifications given by deterministic automata and when one of its parameters, namely L_φ or L_H, is fixed. We study cases where the hiding language L_H can be synthesized too, aiming to either reduce sensing costs or maintain privacy of the environment. Keyphrases: automata theory, imperfect information, synthesis of reactive systems In: Erika Ábrahám, Nikolaj Bjørner and Michael Rawson (editors). Proceedings of the 26th Conference on Logic for Programming, Artificial Intelligence, and Reasoning, vol 112, pages 330-347.
|
