Sciweavers

Share
ATAL
2006
Springer

The complexity of model checking concurrent programs against CTLK specifications

9 years 11 months ago
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
Alessio Lomuscio, Franco Raimondi
Added 20 Aug 2010
Updated 20 Aug 2010
Type Conference
Year 2006
Where ATAL
Authors Alessio Lomuscio, Franco Raimondi
Comments (0)
books