On Promptness in Parity Games*†

DOI10.3233/FI-2015-1235zbMath1336.91023OpenAlexW1745991775MaRDI QIDQ2805469

Aniello Murano, Fabio Mogavero, 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

zbMATH Keywords

parity gameslivenessformal verificationquantitative gamescost-parity gamespromptness\textsc{UPTime}\(\cap\)\textsc{CoUPTime}

Mathematics Subject Classification ID

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

Related Items (9)

Unnamed Item ⋮ Unnamed Item ⋮ Hierarchical cost-parity games ⋮ Unnamed Item ⋮ A delayed promotion policy for parity games ⋮ Cycle detection in computation tree logic ⋮ Natural strategic ability ⋮ Improving parity games in practice ⋮ Quantifying Bounds in Strategy Logic

This page was built for publication: On Promptness in Parity Games*†