Model-checking iterated games

DOI10.1007/s00236-016-0277-yzbMath1380.68275OpenAlexW2508278716MaRDI QIDQ1674862

Chung-Hao Huang, Sven Schewe, Farn Wang

Publication date: 26 October 2017

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-016-0277-y

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Uses Software

• SPIN
• MCMAS
• MOCHA
• MCMAS-SLK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of stochastic \(\omega \)-regular games
• Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
• Augmenting ATL with strategy contexts
• Strategy logic
• Number of quantifiers is better than number of tape cells
• What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic
• Alternating-time temporal logic
• A Generic Constructive Solution for Concurrent Games with Expressive Constraints on Strategies
• ATL* Satisfiability Is 2EXPTIME-Complete
• Coordination Logic
• ATL with Strategy Contexts and Bounded Memory
• Provably Difficult Combinatorial Games
• Complete Proof System for QPTL
• On the Boundary of Behavioral Strategies
• An automata-theoretic approach to branching-time model checking
• Solving Parity Games in Big Steps
• Solving Sequential Conditions by Finite-State Strategies
• Definability in the monadic second-order theory of successor
• Alternating tree automata, parity games, and modal \(\mu\)-calculus

This page was built for publication: Model-checking iterated games