How can I efficiently verify real-time multi-agent systems?
Practical Abstractions for Model Checking Continuous-Time Multi-Agent Systems
This paper tackles the problem of "state-space explosion" in model checking multi-agent systems, especially those involving real-time constraints. It proposes a method to simplify model checking by abstracting away less important variables in individual agent specifications before combining them into a global model. This reduces the overall complexity and makes verification more manageable. The abstraction process is designed to work directly with high-level, modular descriptions of agents, making it potentially suitable for LLM-based multi-agent systems where agents are defined individually. This approach avoids generating a large global state space, which is a major bottleneck for verifying multi-agent systems. The paper also explores the verification of temporal logic properties in real-time multi-agent systems, a relevant aspect for LLM-based agents operating in dynamic environments. The core algorithms are provided, along with experimental results on a voting system, demonstrating the effectiveness of the proposed abstraction in reducing computational resources during verification.