On promptness in parity games

DOI10.3233/FI-2015-1235zbMATH Open1336.91023OpenAlexW1745991775MaRDI QIDQ2805469FDOQ2805469

Authors: Fabio Mogavero, Aniello Murano, Loredana Sorrentino 

Publication date: 11 May 2016

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2015-1235

Recommendations

• On promptness in parity games
• Solving parity games via priority promotion
• Solving parity games via priority promotion
• A delayed promotion policy for parity games
• Window parity games: an alternative approach toward parity games with time bounds

zbMATH Keywords

formal verificationparity gameslivenessquantitative gamescost-parity gamespromptness\textsc{UPTime}\(\cap\)\textsc{CoUPTime}

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Games in extensive form (91A18) Games involving graphs (91A43)

Cited In (13)

• Hierarchical cost-parity games
• Improving parity games in practice
• Ranking Automata and Games for Prioritized Requirements
• Title not available (Why is that?)
• On promptness in parity games
• Quantifying Bounds in Strategy Logic
• A delayed promotion policy for parity games
• Cycle detection in computation tree logic
• Natural strategic ability
• Title not available (Why is that?)
• Mathematical Foundations of Computer Science 2005
• Faster Algorithms for Finitary Games
• Title not available (Why is that?)

This page was built for publication: On promptness in parity games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805469)