Model-Checking iterated games

Authors:
Chung-Hao Huang;Sven Schewe;Farn Wang
Affiliations:
Graduate Institute of Electronic Engineering, National Taiwan University, Taiwan;Department of Computer Sciences, University of Liverpool, UK;Graduate Institute of Electronic Engineering, National Taiwan University, Taiwan, Department of Electrical Engineering, National Taiwan University, Taiwan
Venue:
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Year:
2013

Citing 14
Cited 0

Improved upper and lower bounds for modal logics of programs

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Simulating alternating tree automata by nondeterministic automata: new results and new proofs of the theorems of Rabin, McNaughton and Safra

Theoretical Computer Science
The Model Checker SPIN

IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
An automata-theoretic approach to branching-time model checking

Journal of the ACM (JACM)
Alternating-time temporal logic

Journal of the ACM (JACM)
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic

Logic of Programs, Workshop
Stochastic Game Logic

QEST '07 Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems
The temporal logic of programs

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Solving parity games in big steps

FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Strategy logic

Information and Computation
Coordination logic

CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
A temporal logic for the interaction of strategies

CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
An O(n2) time algorithm for alternating Büchi games

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
What makes ATL* decidable? a decidable fragment of strategy logic

CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a logic for the definition of the collaborative power of groups of agents to enforce different temporal objectives. The resulting temporal cooperation logic (TCL) extends ATL by allowing for successive definition of strategies for agents and agencies. Different to previous logics with similar aims, our extension cuts a fine line between extending the power and maintaining a low complexity: model-checking TCL sentences is EXPTIME complete in the logic, and fixed parameter tractable for specifications of bounded size. This advancement over non-elementary logics is bought by disallowing a too close entanglement between cooperation and competition. We show how allowing such an entanglement immediately leads to a non-elementary complexity. We have implemented a model-checker for the logic and shown the feasibility of model-checking on a few benchmarks.