On Promptness in Parity Games
From MaRDI portal
Publication:2870156
DOI10.1007/978-3-642-45221-5_40zbMath1407.68297OpenAlexW1695941179MaRDI QIDQ2870156
Fabio Mogavero, Aniello Murano, Loredana Sorrentino
Publication date: 17 January 2014
Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-45221-5_40
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (8)
Parameterized linear temporal logics meet costs: still not costlier than LTL ⋮ Reasoning about graded strategy quantifiers ⋮ Unnamed Item ⋮ Hierarchical cost-parity games ⋮ Solving parity games via priority promotion ⋮ Solving Parity Games Using an Automata-Based Algorithm ⋮ Prompt Interval Temporal Logic ⋮ Alternating-time temporal logic ATL with finitely bounded semantics
This page was built for publication: On Promptness in Parity Games
