Measuring Permissivity in Finite Games

DOI10.1007/978-3-642-04081-8_14zbMath1254.91033OpenAlexW1581088344MaRDI QIDQ3184674

Marie Duflot, Gabriel Renault, Patricia Bouyer, Nicolas Markey

Publication date: 22 October 2009

Published in: CONCUR 2009 - Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04081-8_14

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Multistage and repeated games (91A20)

Related Items (2)

A Compositional Framework for Controller Synthesis ⋮ Compositional construction of most general controllers

Uses Software

• UPPAAL TIGA

Cites Work

• Unnamed Item
• Unnamed Item
• Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
• The complexity of mean payoff games on graphs
• Timed Alternating-Time Temporal Logic
• Model-Checking Timed ATL for Durational Concurrent Game Structures
• Permissive strategies: from parity games to safety games
• Hybrid Systems: Computation and Control

This page was built for publication: Measuring Permissivity in Finite Games