The complexity of model checking concurrent programs against CTLK specifications

Proceedings of the International Conference on Autonomous Agents

Volumn 2006, Issue , 2006, Pages 548-550

  Lomuscio, Alessio ^a   Raimondi, Franco ^a  

^a UNIVERSITY COLLEGE LONDON   (United Kingdom)

Author keywords

Complexity; Model checking multi agent systems

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; MATHEMATICAL MODELS;

CONCURRENT PROGRAMS; MODEL CHECKING MULTIAGENT SYSTEMS; TEMPORAL EPISTEMIC FORMULAE;

MULTI AGENT SYSTEMS;

EID: 34247282764     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1160633.1160733     Document Type: Conference Paper

References (11)

1. R. E. Bryant. On the complexity of VLSI implementations and graph representations of boolean functions with application to integer multiplication. IEEE Trans. Comput., 40(2):205-213, 1991.
2. Allan Cheng. Complexity results for model checking. Technical Report RS-95-18, BRICS - Basic Research in Computer Science, Department of Computer Science, University of Aarhus, February 1995.
3. E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications: A practical approach. ACM Transactions on Programming Languages and Systems, 8(2):244-263, 1986.
4. E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. The MIT Press, Cambridge, Massachusetts, 1999.
5. R. Fagin, J. Y. Halpern, Y. Moses, and M. Y. Vardi. Reasoning about Knowledge. MIT Press, Cambridge, 1995.
6. O. Kupferman, M. Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. Journal of the ACM, 47(2):312-360, 2000.
7. K. McMillan. Symbolic model checking: An approach to the state explosion problem. Kluwer Academic Publishers, 1993.
8. W. Nabialek, A. Niewiadomski, W. Penczek, A. Pólrola, and M. Szreter. Verlcs 2004: A model checker for real time and multi-agent systems. In Proceedings of the International Workshop on Concurrency, Specification and Programming (CS&P'04), volume 170 of Informatik-Berichte, pages 88-99. Humboldt University, 2004.
9. Christos H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
10. F. Raimondi and A. Lomuscio. MCMAS - A tool for verification of multi-agent systems. http://www.cs.ucl.ac.uk/staff/f.raimondi/MCMAS/.
11. F. Raimondi and A. Lomuscio. Automatic verification of multi-agent systems by model checking via OBDDs. Journal of Applied. Logic, 2005. To appear in Special issue on Logic-based agent verification.