The complexity of model checking concurrent programs against CTLK specifications

Authors:
Alessio Lomuscio;Franco Raimondi
Affiliations:
University College London -- London, UK;University College London -- London, UK
Venue:
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Year:
2006

Citing 5
Cited 6

Automatic verification of finite-state concurrent systems using temporal logic specifications

ACM Transactions on Programming Languages and Systems (TOPLAS)
On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication

IEEE Transactions on Computers
Reasoning about knowledge

Reasoning about knowledge
Model checking

Model checking
An automata-theoretic approach to branching-time model checking

Journal of the ACM (JACM)

Symbolic model checking for temporal-epistemic logics

ACM SIGACT News
Model Checking Knowledge and Linear Time: PSPACE Cases

LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
MCMAS: A Model Checker for the Verification of Multi-Agent Systems

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
The Complexity of Epistemic Model Checking: Clock Semantics and Branching Time

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
The complexity of model checking concurrent programs against CTLK specifications

DALT'06 Proceedings of the 4th international conference on Declarative Agent Languages and Technologies
Model checking agent knowledge in dynamic access control policies

TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Quantified Score

Hi-index	0.00

Visualization

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.