The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Limits to parallel computation: P-completeness theory
Limits to parallel computation: P-completeness theory
Reasoning about knowledge
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Common knowledge and update in finite environments
Information and Computation
Logic in computer science: modelling and reasoning about systems
Logic in computer science: modelling and reasoning about systems
Model checking
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Modal logic
Symbolic Model Checking
Model checking multi-agent systems with MABLE
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
Introduction to Multiagent Systems
Introduction to Multiagent Systems
Model Checking Knowledge and Time in Systems with Perfect Recall (Extended Abstract)
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
NuSMV 2: An OpenSource Tool for Symbolic Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Towards model checking interpreted systems
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Model Checking for Combined Logics with an Application to Mobile Systems
Automated Software Engineering
On the complexity of practical ATL model checking
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
The complexity of model checking concurrent programs against CTLK specifications
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
From Bounded to Unbounded Model Checking for Temporal Epistemic Logic
Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
MCMAS: a model checker for multi-agent systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Model-Checking Strategic Ability and Knowledge of the Past of Communicating Coalitions
Declarative Agent Languages and Technologies VI
Revisiting Satisfiability and Model-Checking for CTLK with Synchrony and Perfect Recall
Computational Logic in Multi-Agent Systems
Model Checking Temporal-Epistemic Logic Using Alternating Tree Automata
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
An epistemic Halpern-Shoham logic
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
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.