Satisfiability Checking of Strategy Logic with Simple Goals

Kacprzak, Magdalena; Niewiadomski, Artur; Penczek, Wojciech

doi:10.24963/kr.2021/38

Cited by 3 publications

(1 citation statement)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [27] a lazy SMT-solver for Boolean monotonic theories (SMMT) was applied to model synthesis for Computation Tree Logic (CTL [9,49]). This method was then extended in [22,34] to deciding the satisfiability of Alternating-time Temporal Logic (ATL [5,6]), and in [23] to deciding Simple-Goal Strategy Logic (SL[SG] [10]). Another approach to checking satisfiability of ATL was developed in [14], using a tableau-based decision procedure.…”

Section: Related Workmentioning

confidence: 99%

SMT-Based Satisfiability Checking of Strategic Metric Temporal Logic

Kacprzak,

Niewiadomski,

Penczek

et al. 2023

Frontiers in Artificial Intelligence and Applications

View full text Add to dashboard Cite

The paper presents a novel SMT-based method for testing the satisfiability of formulae that express strategic properties of timed multi-agent systems represented by networks of timed automata. Strategic Metric Temporal Logic (SMTL) is introduced, which extends Metric Temporal Logic (MTL) with strategy operators. SMTL is interpreted over maximal continuous time runs of timed automata. We define a procedure that synthesises a model for a given SMTL formula if such a model exists. The method exploits Satisfiability Modulo Theories (SMT) techniques and Parametric Bounded Model Checking algorithms. The presented approach enables bounded satisfiability checking, where the model is partially given and needs to be completed in line with the given specification. Our method has been implemented, and its application is demonstrated through an example of the well-known dining philosophers problem extended with clocks and strategies. The experimental results are quite encouraging.

show abstract