Parameterized Algorithms for Parity Games

D 2015

Parameterized Algorithms for Parity Games

GAJARSKÝ, Jakub, Sebastian ORDYNIAK, Michael LAMPIS, Valia MITSOU, Kazuhisa MAKINO et. al.

Basic information

Original name

Parameterized Algorithms for Parity Games

Authors

GAJARSKÝ, Jakub (703 Slovakia, guarantor, belonging to the institution), Sebastian ORDYNIAK (276 Germany), Michael LAMPIS (300 Greece), Valia MITSOU (300 Greece) and Kazuhisa MAKINO (392 Japan)

Edition

9235. vyd. Berlin, MFCS 2015, LNCS 9235, p. 336-347, 12 pp. 2015

Publisher

Springer

Other information

Language

English

Type of outcome

Stať ve sborníku

Field of Study

10201 Computer sciences, information science, bioinformatics

Country of publisher

Germany

Confidentiality degree

není předmětem státního či obchodního tajemství

Publication form

electronic version available online

Impact factor

Impact factor: 0.402 in 2005

RIV identification code

RIV/00216224:14330/15:00081184

Organization unit

Faculty of Informatics

ISBN

978-3-662-48053-3

ISSN

DOI

http://dx.doi.org/10.1007/978-3-662-48054-0_28

UT WoS

000371027300028

Keywords in English

parity games; model checking; modular-width

Abstract

V originále

Determining the winner of a Parity Game is a major problem in computational complexity with a number of applications in verification. In a parameterized complexity setting, the problem has often been considered with parameters such as (directed versions of) treewidth or clique-width, by applying dynamic programming techniques. In this paper we adopt a parameterized approach which is more inspired by well-known (non-parameterized) algorithms for this problem. We consider a number of natural parameterizations, such as by Directed Feedback Vertex Set, Distance to Tournament, and Modular Width. We show that, for these parameters, it is possible to obtain recursive parameterized algorithms which are simpler, faster and only require polynomial space. We complement these results with some algorithmic lower bounds which, among others, rule out a possible avenue for improving the best-known sub-exponential time algorithm for parity games.

Links

GBP202/12/G061, research and development project

Name: Centrum excelence - Institut teoretické informatiky (CE-ITI) (Acronym: CE-ITI)

Investor: Czech Science Foundation

MUNI/A/1159/2014, interní kód MU

Name: Rozsáhlé výpočetní systémy: modely, aplikace a verifikace IV.

Investor: Masaryk University, Category A

MUNI/A/1206/2014, interní kód MU

Name: Zapojení studentů Fakulty informatiky do mezinárodní vědecké komunity (Acronym: SKOMU)

Investor: Masaryk University, Category A

Citovat

GAJARSKÝ, Jakub, Sebastian ORDYNIAK, Michael LAMPIS, Valia MITSOU and Kazuhisa MAKINO. Parameterized Algorithms for Parity Games. Online. In Italiano, Giuseppe F. , Pighizzini, Giovanni, Sannella, Donald T. MFCS 2015, LNCS 9235. 9235th ed. Berlin: Springer, 2015, p. 336-347. ISBN 978-3-662-48053-3. Available from: https://dx.doi.org/10.1007/978-3-662-48054-0_28.

@inproceedings{1316738,
   author = {Gajarský, Jakub and Ordyniak, Sebastian and Lampis, Michael and Mitsou, Valia and Makino, Kazuhisa},
   address = {Berlin},
   booktitle = {MFCS 2015, LNCS 9235},
   doi = {http://dx.doi.org/10.1007/978-3-662-48054-0_28},
   edition = {9235},
   editor = {Italiano, Giuseppe F. , Pighizzini, Giovanni, Sannella, Donald T.},
   keywords = {parity games; model checking; modular-width},
   howpublished = {elektronická verze "online"},
   language = {eng},
   location = {Berlin},
   isbn = {978-3-662-48053-3},
   pages = {336-347},
   publisher = {Springer},
   title = {Parameterized Algorithms for Parity Games},
   year = {2015}
}

TY  - JOUR
ID  - 1316738
AU  - Gajarský, Jakub - Ordyniak, Sebastian - Lampis, Michael - Mitsou, Valia - Makino, Kazuhisa
PY  - 2015
TI  - Parameterized Algorithms for Parity Games
PB  - Springer
CY  - Berlin
SN  - 9783662480533
KW  - parity games
KW  - model checking
KW  - modular-width
N2  - Determining the winner of a Parity Game is a major problem in computational complexity with a number of applications in verification. In a parameterized complexity setting, the problem has often been considered with parameters such as (directed versions of) treewidth or clique-width, by applying dynamic programming techniques. In this paper we adopt a parameterized approach which is more inspired by well-known (non-parameterized) algorithms for this problem. We consider a number of natural parameterizations, such as by Directed Feedback Vertex Set, Distance to Tournament, and Modular Width. We show that, for these parameters, it is possible to obtain recursive parameterized algorithms which are simpler, faster and only require polynomial space. We complement these results with some algorithmic lower bounds which, among others, rule out a possible avenue for improving the best-known sub-exponential time algorithm for parity games.
ER  -

GAJARSKÝ, Jakub, Sebastian ORDYNIAK, Michael LAMPIS, Valia MITSOU and Kazuhisa MAKINO. Parameterized Algorithms for Parity Games. Online. In Italiano, Giuseppe F. , Pighizzini, Giovanni, Sannella, Donald T. \textit{MFCS 2015, LNCS 9235}. 9235th ed. Berlin: Springer, 2015, p.~336-347. ISBN~978-3-662-48053-3. Available from: https://dx.doi.org/10.1007/978-3-662-48054-0\_{}28.

Detailed Information on Publication Record