We introduce an extension of Alternating-Time Temporal Logic (ATL) that incorporates default actions to model communication failures in multi-agent systems. Our framework, ATL-kD, allows for a limited number of communication failures during which agents’ intended strategies may not be delivered. In the event of such a communication failure, a predefined default action is played. We analyse the computational complexity of model checking in this setting, showing NP-hardness and coNP-hardness in general, but polynomial-time solvability when default actions are restricted to a fixed subset of agents. We also study a variant with default preferences, which better handles cases where the default action might be unavailable in some states due to protocol constraints. Additionally, we introduce default action updates, allowing the default action to be revised during system execution. Together, these results provide a formal foundation for robust verification under unreliable communication.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Alternating-Time Temporal Logic with Default Actions

  • Jakub Michaliszyn

摘要

We introduce an extension of Alternating-Time Temporal Logic (ATL) that incorporates default actions to model communication failures in multi-agent systems. Our framework, ATL-kD, allows for a limited number of communication failures during which agents’ intended strategies may not be delivered. In the event of such a communication failure, a predefined default action is played. We analyse the computational complexity of model checking in this setting, showing NP-hardness and coNP-hardness in general, but polynomial-time solvability when default actions are restricted to a fixed subset of agents. We also study a variant with default preferences, which better handles cases where the default action might be unavailable in some states due to protocol constraints. Additionally, we introduce default action updates, allowing the default action to be revised during system execution. Together, these results provide a formal foundation for robust verification under unreliable communication.