Model Checking Abilities of Agents: A Closer Look
- 30 October 2007
- journal article
- research article
- Published by Springer Science and Business Media LLC in Theory of Computing Systems
- Vol. 42 (3), 366-410
- https://doi.org/10.1007/s00224-007-9080-z
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Alternating-time logic with imperfect recallElectronic Notes in Theoretical Computer Science, 2004
- Alternating-time temporal logicJournal of the ACM, 2002
- An automata-theoretic approach to branching-time model checkingJournal of the ACM, 2000
- MOCHA: Modularity in model checkingLecture Notes in Computer Science, 1998
- Fast planning through planning graph analysisArtificial Intelligence, 1997
- About the expressive power of CTL combinatorsInformation Processing Letters, 1995
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986
- “Sometimes” and “not never” revisitedJournal of the ACM, 1986
- Decision procedures and expressiveness in the temporal logic of branching timeJournal of Computer and System Sciences, 1985
- Quantifiers and Propositional AttitudesThe Journal of Philosophy, 1956