Quasipolynomial Set-Based Symbolic Algorithms for Parity Games

DOI10.29007/5Z5KzbMath1415.68142arXiv1909.04983OpenAlexW3105831223MaRDI QIDQ5222958

Alexander Svozil, Krishnendu Chatterjee, Wolfgang Dvořák, Monika R. Henzinger

Publication date: 4 July 2019

Published in: EPiC Series in Computing (Search for Journal in Brave)

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

zbMATH Keywords

symbolic computationparity gamesmodel checkinggraph gamesprogress measure

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (5)

The Theory of Universal Graphs for Infinite Duration Games ⋮ Universal algorithms for parity games and nested fixpoints ⋮ Fine-grained complexity lower bounds for problems in computer aided verification ⋮ Unnamed Item ⋮ Quasipolynomial computation of nested fixpoints

This page was built for publication: Quasipolynomial Set-Based Symbolic Algorithms for Parity Games