{'fraction_non_alphanumeric': 0.037460978147762745, 'fraction_numerical': 0.0, 'mean_word_length': 5.287581699346405, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Model Checking Dynamic Strategy Logic with Memoryless Strategies

Recently, strategy specification and verification has been an active research direction in many areas, such as multi-agent systems, artificial intelligence, formal methods, logic, and so on. Since alternating-time temporal logic (ATL/ATL*) was proposed by Alur et al., many strategic logics, which are based on ATL/ATL*, have been introduced by many researchers. Among them strategy logic (SL) is an outstanding representative, which can express more properties like the existence of Nash Equilibrium in game theory; however, it cannot express regular temporal properties, nor epistemic properties. Based on linear dynamic logic (LDL), we propose a new strategic logic with knowledge, by extending SL. Moreover, under the semantics of memoryless strategies, we show that the model checking problem for this logic is PSPACE-complete with both the length of the sentence and the size of the model.