Model-checking iterated games
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3870578 (Why is no real title available?)
- scientific article; zbMATH DE number 1444727 (Why is no real title available?)
- A Generic Constructive Solution for Concurrent Games with Expressive Constraints on Strategies
- A survey of stochastic \(\omega \)-regular games
- ATL with Strategy Contexts and Bounded Memory
- ATL with strategy contexts: expressiveness and model checking
- ATL* Satisfiability Is 2EXPTIME-Complete
- Alternating tree automata, parity games, and modal \(\mu\)-calculus
- Alternating-time temporal logic
- An automata-theoretic approach to branching-time model checking
- Augmenting ATL with strategy contexts
- Complete Proof System for QPTL
- Coordination logic
- Definability in the monadic second-order theory of successor
- Number of quantifiers is better than number of tape cells
- On the boundary of behavioral strategies
- Provably Difficult Combinatorial Games
- Reasoning about strategies
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
- Solving Parity Games in Big Steps
- Solving Sequential Conditions by Finite-State Strategies
- Strategy logic
- What makes \textsc{Atl}* decidable? A decidable fragment of strategy logic
Cited in
(7)- Synthesizing coalitions for multi-agent games
- The Temporal Logic of Coalitional Goal Assignments in Concurrent Multiplayer Games
- Model-checking iterated games
- Tools and Algorithms for the Construction and Analysis of Systems
- On-the-Fly Techniques for Game-Based Software Model Checking
- Pushdown processes: Games and model-checking
- A cooperation logic for declaration structures
This page was built for publication: Model-checking iterated games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1674862)