Hierarchical cost-parity games

DOI10.1016/j.tcs.2020.10.002zbMath1464.68232OpenAlexW3092331392MaRDI QIDQ2210523

Laura Bozzelli, Loredana Sorrentino, Giuseppe Perelli, Aniello Murano

Publication date: 6 November 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/7917/

zbMATH Keywords

parity gamesformal methodshierarchical systemscost-parity games

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Applications of game theory (91A80) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Improved model checking of hierarchical systems
• Results on the propositional \(\mu\)-calculus
• From liveness to promptness
• Energy parity games
• Module checking
• On Promptness in Parity Games*†
• On Promptness in Parity Games
• Finitary winning in ω-regular games
• A Deterministic Subexponential Algorithm for Solving Parity Games
• The Complexity of Tree Automata and Logics of Programs
• Promptness in ω-Regular Automata
• An automata-theoretic approach to branching-time model checking
• Parity and Streett Games with Costs
• Program Complexity in Hierarchical Module Checking
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

This page was built for publication: Hierarchical cost-parity games