The complexity of model checking concurrent programs against CTLK specifications

This paper presents complexity results for model checking concurrent programs against temporal-epistemic formulae. We apply these results to evaluate the complexity of verifying programs by means of two model checkers for multi-agent systems: MCMAS and Verics. General Terms Algorithms; Theory; Verification Keywords Model checking multi-agent systems; Complexity

• Type: Conference
• Year: 2006
• Where: ATAL
• Authors: Alessio Lomuscio, Franco Raimondi
• Keywords: ATAL 2006, Intelligent Agents, Model Checking, Multi-agent Systems, Paper Presents Complexity