Assume-Guarantee Synthesis for Prompt Linear Temporal Logic

Nathanaël Fijalkow, Bastien Maubert, Aniello Murano, Moshe Vardi
2020 Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence  
Prompt-LTL extends Linear Temporal Logic with a bounded version of the "eventually" operator to express temporal requirements such as bounding waiting times. We study assume-guarantee synthesis for prompt-LTL: the goal is to construct a system such that for all environments satisfying a first prompt-LTL formula (the assumption) the system composed with this environment satisfies a second prompt-LTL formula (the guarantee). This problem has been open for a decade. We construct an algorithm for
more » ... lving it and show that, like classical LTL synthesis, it is 2-EXPTIME-complete.
doi:10.24963/ijcai.2020/17 dblp:conf/ijcai/FijalkowMMV20 fatcat:uwn7gwnbe5gtjmls6l6nauafke