A generic constructive solution for concurrent games with expressive constraints on strategies

Authors:
Sophie Pinchinat
Affiliations:
Computer Sciences Laboratory of RSISE, The Australian National University, Canberra
Venue:
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Year:
2007

Citing 15
Cited 8

CTL and ECTL as fragments of the modal &mgr;-calculus

Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
Simulating alternating tree automata by nondeterministic automata: new results and new proofs of the theorems of Rabin, McNaughton and Safra

Theoretical Computer Science
Deciding the winner in parity games is in UP ∩ co-UP

Information Processing Letters
An automata-theoretic approach to branching-time model checking

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

Journal of the ACM (JACM)
From Pre-historic to Post-modern Symbolic Model Checking

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Satisfiability in Alternating-time Temporal Logic

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Unbounded Model Checking for Alternating-Time Temporal Logic

AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
Two-player nonzero-sum ω-regular games

CONCUR 2005 - Concurrency Theory
Complete axiomatization and decidability of alternating-time temporal logic

Theoretical Computer Science
On the expressiveness and complexity of ATL

FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Admissibility in infinite games

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Satisfiability and finite model property for the alternating-time µ-calculus

CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Ticc: a tool for interface compatibility and composition

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Strategy logic

CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory

ATL with Strategy Contexts and Bounded Memory

LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Coordination logic

CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Strategies in games: a logic-automata study

ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
Quantified CTL: expressiveness and model checking

CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
What makes ATL* decidable? a decidable fragment of strategy logic

CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
The complexity of one-agent refinement modal logic

JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
The complexity of one-agent refinement modal logic (extended abstract)

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
On the Boundary of Behavioral Strategies

LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The emerging technology of interacting systems calls for new formalisms to ensure their reliability. Concurrent games are paradigmatic abstract models for which several logics have been studied. However, the existing formalisms show certain limitations in face of the range of strategy properties required to address intuitive situations. We propose a generic solution to specify expressive constraints on strategies in concurrent games. Our formalism naturally extends alternating-time logics while being highly flexible to combine constraints. Our approach is constructive and can synthesize many types of complex strategies, via automata-theoretic techniques.