Solving parity games on the GPU

Philipp Hoffmann, Michael Luttenberger

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

16 Scopus citations

Abstract

We present our GPU-based implementations of three well-known algorithms for solving parity games. Our implementations are in general faster by a factor of at least two than the corresponding implementations found in the widely known PGSolver collection of solvers. For benchmarking we use several of PGSolver 's benchmarks as well as arenas obtained by means of the reduction of the language inclusion problem of nondeterministic Büchi automata to parity games with only three colors [3]. The benchmark suite of http://languageinclusion.org/ CONCUR2011 was used in the latter case.

Original languageEnglish
Title of host publicationAutomated Technology for Verification and Analysis - 11th International Symposium, ATVA 2013, Proceedings
Pages455-459
Number of pages5
DOIs
StatePublished - 2013
Event11th International Symposium on Automated Technology for Verification and Analysis, ATVA 2013 - Hanoi, Viet Nam
Duration: 15 Oct 201318 Oct 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8172 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference11th International Symposium on Automated Technology for Verification and Analysis, ATVA 2013
Country/TerritoryViet Nam
CityHanoi
Period15/10/1318/10/13

Fingerprint

Dive into the research topics of 'Solving parity games on the GPU'. Together they form a unique fingerprint.

Cite this