Amanote Research
Register
Sign In
On Promptness in Parity Games*†
Fundamenta Informaticae
- Netherlands
doi 10.3233/fi-2015-1235
Full Text
Open PDF
Abstract
Available in
full text
Categories
Information Systems
Algebra
Number Theory
Mathematics
Computational Theory
Theoretical Computer Science
Date
July 8, 2015
Authors
Fabio Mogavero
Aniello Murano
Loredana Sorrentino
Publisher
IOS Press
Related search
Mean-Payoff Parity Games
Algorithms for Stochastic Parity Games
Timed Parity Games: Complexity and Robustness
Logical Methods in Computer Science
Computer Science
Theoretical Computer Science
The Descriptive Complexity of Parity Games
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Perfect-Information Stochastic Mean-Payoff Parity Games
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Parity Games of Bounded Tree- And Clique-Width
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
A Pseudo-Quasi-Polynomial Algorithm for Mean-Payoff Parity Games
From Liveness to Promptness
Memoryless Determinacy of Parity and Mean Payoff Games: A Simple Proof
Theoretical Computer Science
Computer Science
Theoretical Computer Science
