Decision procedures and expressiveness in the temporal logic of branching time
Journal of Computer and System Sciences
Patterns in property specifications for finite-state verification
Proceedings of the 21st international conference on Software engineering
"Sometime" is sometimes "not never": on the temporal logic of programs
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
CTL+ is Exponentially more Succinct than CTL
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Efficient Büchi Automata from LTL Formulae
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Alternating-time Temporal Logic
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Possibilistic and Probabilistic Abstraction-Based Model Checking
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
On the expressiveness and complexity of ATL
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Verifying agents with memory is harder than it seemed
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Verifying agents with memory is harder than it seemed
AI Communications - European Workshop on Multi-Agent Systems (EUMAS) 2009
Comparing variants of strategic ability
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Autonomous Agents and Multi-Agent Systems
| Hi-index | 0.00 |
Alternating Time Temporal Logic (ATL) [2] has proved useful in specifying systems that can be viewed as the parallel composition of a set of agents. It has tool-support for model checking and simulation in the form of Mocha [1]. ATL* is a more expressive form of ATL which provides a more natural way to write specifications. Whilst ATL can be model checked in linear time (relative to the size of the model), ATL* is 2EXPTIME-complete [2]. Here we present a method of "translating" an ATL* formula, into ATL so that model checking can then be performed. This method cannot, in general, be entirely exact but instead produces a strong and a weak bound. From these we may be able to infer whether the original formula was satisfied. To minimise the number of undecided cases, the bounds must be as close as possible to the original. Exact translations help to ensure that this is so, and we have identified a subset of ATL* which can be translated without loss. Case studies support the method by showing that most ATL* formulae attempted did yield conclusive results, even after approximation.