Quantifying Bounds in Strategy Logic

Nathanaël Fijalkow, Bastien Maubert, Aniello Murano, Sasha Rubin, Michael Wagner
2018 Annual Conference for Computer Science Logic  
Program synthesis constructs programs from specifications in an automated way. Strategy Logic (SL) is a powerful and versatile specification language whose goal is to give theoretical foundations for program synthesis in a multi-agent setting. One limitation of Strategy Logic is that it is purely qualitative. For instance it cannot specify quantitative properties of executions such as "every request is quickly granted", or quantitative properties of trees such as "most executions of the system
more » ... erminate". In this work, we extend Strategy Logic to include quantitative aspects in a way that can express bounds on "how quickly" and "how many". We define Prompt Strategy Logic, which encompasses Prompt LTL (itself an extension of LTL with a prompt eventuality temporal operator), and we define Bounded-Outcome Strategy Logic which has a bounded quantifier on paths. We supply a general technique, based on the study of automata with counters, that solves the model-checking problems for both these logics.
doi:10.4230/lipics.csl.2018.23 dblp:conf/csl/FijalkowMMR18 fatcat:zyv36ipdqff2rbsnkxxbeughem