Alternating-time temporal logic
Journal of the ACM (JACM)
Alternating Refinement Relations
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
A game-based verification of non-repudiation and fair exchange protocols
Journal of Computer Security - IFIP 2000
Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
AAMAS06 AAMAS '06 - 5th International Joint Conference on Autonomous Agents and Multi-agent Systems 2006
Knowing how to play: uniform choices in logics of agency
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
What agents can achieve under incomplete information
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
Infinite State AMC-Model Checking for Cryptographic Protocols
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Probabilistic Alternating-time Temporal Logic and Model Checking Algorithm
FSKD '07 Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02
Verifying temporal properties of finite-state probabilistic programs
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
What Agents Can Probably Enforce
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Alternating epistemic Mu-calculus
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
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
A logic of probabilistic knowledge and strategy
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Autonomous Agents and Multi-Agent Systems
| Hi-index | 0.00 |
Alternating-time Temporal Logic (ATL) [1] is used to reason about strategic abilities of agents. Aiming at strategies that can realistically be implemented in software, many variants of ATL study a setting where strategies may only take available information into account [7]. Another generalization of ATL is Probabilistic ATL [4], where strategies achieve their goal with a certain probability. We introduce a semantics of ATL that takes into account both of these aspects. We prove that our semantics allows simulation relations similar in spirit to usual bisimulations, and has a decidable model checking problem in the case of memoryless strategies (for memory-dependent strategies the problem is undecidable).