The complexity of model checking concurrent programs against CTLK specifications
Alessio R. Lomuscio, Franco Raimondi · 2006
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.