scientific article; zbMATH DE number 7453081

MaRDI QIDQ5020529

Tom van Dijk, Bob Rubbens

Publication date: 6 January 2022

Full work available at URL: https://arxiv.org/abs/1909.07659

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Applications of game theory (91A80) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (3)

Justifications and a reconstruction of parity game solving algorithms ⋮ Unnamed Item ⋮ Unnamed Item

Uses Software

• PGSolver
• Strix
• Oink

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strix
• Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
• Results on the propositional \(\mu\)-calculus
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Certification for $$\mu $$ μ -Calculus with Winning Strategies
• Solving Parity Games Using an Automata-Based Algorithm
• The mu-calculus and Model Checking
• Solving Parity Games in Practice
• Monadic second order logic on tree-like structures
• Solving Parity Games via Priority Promotion
• On model checking for the \(\mu\)-calculus and its fragments
• Attracting tangles to solve parity games

This page was built for publication: