Strategies synthesized using formal methods can be complex and often require infinite memory, which does not correspond to the expected behavior when trying to model Multi-Agent Systems (MAS). To capture such behaviors, natural strategies are a recently proposed framework striking a balance between the ability of agents to strategize with memory and the model-checking complexity, but until now has been restricted to fully deterministic settings. For the first time, we consider the probabilistic temporal logics PATL and PATL* under natural strategies (NatPATL and NatPATL*, resp.). As main result we show that, in stochastic MAS, NatPATL model-checking is NP-complete when the active coalition is restricted to deterministic strategies. We also give a 2NEXPTIME complexity result for NatPATL* with the same restriction. In the unrestricted case, we give an EXPSPACE complexity for NatPATL and 3EXPSPACE complexity for NatPATL*.
CoMet: Metaphor-Driven Covert Communication for Multi-Agent Language Games
School of Artificial Intelligence, Beijing Normal University(北京师范大学人工智能学院);Engineering Research Center of Intelligent Technology and Educational Application, Ministry of Education(教育部智能技术与教育应用工程研究中心)
Towards Assume-Guarantee Verification of Abilities in Stochastic Multi-Agent Systems
Institute of Computer Science, Polish Academy of Sciences(波兰科学院计算机科学研究所);Faculty of Mathematics and Computer Science, Nicolaus Copernicus University(尼古拉·哥白尼大学数学与计算机科学学院)