Model Checking Dynamic Strategy Logic with Memoryless Strategies

Xiong, Liping; Guo, Sumei

doi:10.1145/3424978.3425046

Cited by 2 publications

(1 citation statement)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, here we just consider perfect recall strategies in multi-agent concurrent games with complete information. Next, we will further study these new proposed strategic logics under incomplete information [45][46][47], where the strategies of agents maybe memoryless or perfect recall [48]. In this paper, we present formal frameworks and show technical results; in the future, we will also present case studies or practical applications to illustrate these theories, such as information security [49], solving winning strategies [50], and voting protocol [51].…”

Section: Discussionmentioning

confidence: 99%

Representation and Reasoning about Strategic Abilities with ω-Regular Properties

Xiong

Guo

2021

Mathematics

Self Cite

View full text Add to dashboard Cite

Specification and verification of coalitional strategic abilities have been an active research area in multi-agent systems, artificial intelligence, and game theory. Recently, many strategic logics, e.g., Strategy Logic (SL) and alternating-time temporal logic (ATL*), have been proposed based on classical temporal logics, e.g., linear-time temporal logic (LTL) and computational tree logic (CTL*), respectively. However, these logics cannot express general ω-regular properties, the need for which are considered compelling from practical applications, especially in industry. To remedy this problem, in this paper, based on linear dynamic logic (LDL), proposed by Moshe Y. Vardi, we propose LDL-based Strategy Logic (LDL-SL). Interpreted on concurrent game structures, LDL-SL extends SL, which contains existential/universal quantification operators about regular expressions. Here we adopt a branching-time version. This logic can express general ω-regular properties and describe more programmed constraints about individual/group strategies. Then we study three types of fragments (i.e., one-goal, ATL-like, star-free) of LDL-SL. Furthermore, we show that prevalent strategic logics based on LTL/CTL*, such as SL/ATL*, are exactly equivalent with those corresponding star-free strategic logics, where only star-free regular expressions are considered. Moreover, results show that reasoning complexity about the model-checking problems for these new logics, including one-goal and ATL-like fragments, is not harder than those of corresponding SL or ATL*.

show abstract