“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
About the expressive power of CTL combinators
Information Processing Letters
Reasoning about knowledge
Formal Methods in System Design - Special issue on The First Federated Logic Conference (FLOC'96), part II
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Symbolic Model Checking
Alternating-time temporal logic
Journal of the ACM (JACM)
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Alternating-time Temporal Logic
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
On the complexity of practical ATL model checking
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Model Checking Abilities of Agents: A Closer Look
Theory of Computing Systems
Do agents make model checking explode (computationally)?
CEEMAS'05 Proceedings of the 4th international Central and Eastern European conference on Multi-Agent Systems and Applications
Specification and verification of multi-agent systems
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
| Hi-index | 0.00 |
I present an overview of complexity results for model checking of temporal and strategic logics. Unfortunately, it is possible to manipulate the context so that different complexity results are obtained for the same problem. Among other things, this means that the results are often distant from the "practical" complexity which is encountered when one tries to use the formalisms in reality.