The complexity of model checking concurrent programs against CTLK specifications

Alessio Lomuscio, Franco Raimondi

Abstract

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.
BibTeX
@inproceedings{lomuscio2006complexity,
  author = {Alessio Lomuscio and Franco Raimondi},
  title = {{The complexity of model checking concurrent programs against CTLK specifications}},
  booktitle = {AAMAS},
  year = {2006},
  doi = {10.1145/1160633.1160733},
}

Loading related content...

Figure