Imperial College London

ProfessorAlessioLomuscio

Faculty of EngineeringDepartment of Computing

Professor of Logic for Multiagent Systems
 
 
 
//

Contact

 

+44 (0)20 7594 8414a.lomuscio Website

 
 
//

Location

 

504Huxley BuildingSouth Kensington Campus

//

Summary

 

Publications

Citation

BibTex format

@inproceedings{Lomuscio:2006,
author = {Lomuscio, A and Raimondi, F},
pages = {29--42},
title = {The complexity of model checking concurrent programs against CTLK specifications},
year = {2006}
}

RIS format (EndNote, RefMan)

TY  - CPAPER
AB - © Springer-Verlag Berlin Heidelberg 2006. This paper presents complexity results for model checking formulae of CTLK (a logic to reason about time and knowledge in multi-agent systems) in concurrent programs. We apply these results to evaluate the complexity of verifying programs of two model checkers for multi-agent systems: MCMAS and Verics.
AU - Lomuscio,A
AU - Raimondi,F
EP - 42
PY - 2006///
SN - 0302-9743
SP - 29
TI - The complexity of model checking concurrent programs against CTLK specifications
ER -