Register games

MaRDI QIDQ5114824zbMATH OpenFDO

Authors Karoliina Lehtinen, Udi Boker

Publication date 26 June 2020

Full work available at URL https://arxiv.org/abs/1902.10654, https://lmcs.episciences.org/6487

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Recommendations

• A modal \(\mu\) perspective on solving parity games in quasi-polynomial time
• Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time
• Deciding Parity Games in Quasi-polynomial Time
• Deciding parity games in quasipolynomial time
• A brief excursion to parity games

Cites work

• scientific article; zbMATH DE number 1500523 (Why is no real title available?)
• scientific article; zbMATH DE number 1500644 (Why is no real title available?)
• scientific article; zbMATH DE number 1775458 (Why is no real title available?)
• scientific article; zbMATH DE number 7215285 (Why is no real title available?)
• Alternating Tree Automata and Parity Games
• Automaton-Based Criteria for Membership in CTL
• Bisimulation invariant monadic-second order logic in the finite
• Deciding the first levels of the modal \(\mu\) alternation hierarchy by formula construction
• Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
• Entanglement and the complexity of directed graphs
• On Independent Circuits Contained in a Graph
• On alternating \(\omega\)-automata
• Recursive algorithm for parity games requires exponential time
• Regular languages of thin trees
• Robust worst cases for parity games algorithms
• Solving Games Without Determinization
• Solving parity games using an automata-based algorithm
• Succinct progress measures for solving parity games
• Taming past LTL and flat counter systems
• Testing and generating infinite sequences by a finite automaton
• The Complexity of Tree Automata and Logics of Programs
• The Descriptive Complexity of Parity Games
• The modal mu-calculus alternation hierarchy is strict
• Weak Kripke structures and LTL
• Weak alternating automata are not that weak

Cited in

(7)

• scientific article; zbMATH DE number 7649927 (Why is no real title available?)
• scientific article; zbMATH DE number 1796969 (Why is no real title available?)
• Deposit games with reinvestment
• scientific article; zbMATH DE number 7215285 (Why is no real title available?)
• The Theory of Universal Graphs for Infinite Duration Games
• scientific article; zbMATH DE number 7471692 (Why is no real title available?)
• Parity games on temporal graphs

This page was built for publication: Register games

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