Results 1 - 10 of 321

Energy parity games

by Krishnendu Chatterjee, Laurent Doyen - PROC. OF LICS, IEEE COMPUTER SOCIETY
"... Energy parity games are infinite two-player turn-based games played on weighted graphs. The objective of the game combines a (qualitative) parity condition with the (quantitative) requirement that the sum of the weights (i.e., the level of energy in the game) must remain positive. Beside their own i ..."
Abstract - Cited by 60 (11 self) - Add to MetaCart
Energy parity games are infinite two-player turn-based games played on weighted graphs. The objective of the game combines a (qualitative) parity condition with the (quantitative) requirement that the sum of the weights (i.e., the level of energy in the game) must remain positive. Beside their own

Solving Parity Games in Practice

by Oliver Friedmann, Martin Lange
"... Abstract. Parity games are 2-player games of perfect information and infinite duration that have important applications in automata theory and decision procedures (validity as well as model checking) for temporal logics. In this paper we investigate practical aspects of solving parity games. The mai ..."
Abstract - Cited by 27 (9 self) - Add to MetaCart
Abstract. Parity games are 2-player games of perfect information and infinite duration that have important applications in automata theory and decision procedures (validity as well as model checking) for temporal logics. In this paper we investigate practical aspects of solving parity games

Algorithmic analysis of Parity games

by Jan Obdrzalek , 2006
"... Parity games are discrete infinite games of two players with complete information. There are two main motivations to study parity games. Firstly the problem of deciding a winner in a parity game is polynomially equivalent to the modal µ-calculus model checking, and therefore is very important in the ..."
Abstract - Cited by 5 (1 self) - Add to MetaCart
Parity games are discrete infinite games of two players with complete information. There are two main motivations to study parity games. Firstly the problem of deciding a winner in a parity game is polynomially equivalent to the modal µ-calculus model checking, and therefore is very important

Quantitative Stochastic Parity Games

by Krishnendu Chatterjee, Thomas A. Henzinger, et al.
"... We study perfect-information stochastic parity games. These are two-player nonterminating games which are played on a graph with turn-based probabilistic transitions. A play results in an infinite path and the conflicting goals of the two players are!-regular path properties, formalized as parity w ..."
Abstract - Cited by 69 (32 self) - Add to MetaCart
We study perfect-information stochastic parity games. These are two-player nonterminating games which are played on a graph with turn-based probabilistic transitions. A play results in an infinite path and the conflicting goals of the two players are!-regular path properties, formalized as parity

On promptness in parity games

by Fabio Mogavero, Aniello Murano, Loredana Sorrentino - In LPAR’13, LNCS 8312 , 2013
"... Abstract. Parity games are a powerful formalism for the automatic synthesis and verification of reactive systems. They are closely related to alternating ω-automata and emerge as a natural method for the solution of the µ-calculus model checking problem. Due to these strict connections, parity games ..."
Abstract - Cited by 3 (2 self) - Add to MetaCart
Abstract. Parity games are a powerful formalism for the automatic synthesis and verification of reactive systems. They are closely related to alternating ω-automata and emerge as a natural method for the solution of the µ-calculus model checking problem. Due to these strict connections, parity

Solving counter parity games

by Dietmar Berwanger, Simon Leßenich - In Proc. of MFCS’12, LNCS , 2012
"... Abstract. We study a class of parity games equipped with counters that evolve according to arbitrary non-negative affine functions. These games capture several cost models for dynamic systems from the literature. We present an elementary algorithm for computing the exact value of a counter parity ga ..."
Abstract - Cited by 3 (2 self) - Add to MetaCart
Abstract. We study a class of parity games equipped with counters that evolve according to arbitrary non-negative affine functions. These games capture several cost models for dynamic systems from the literature. We present an elementary algorithm for computing the exact value of a counter parity

Clique-Width and Parity Games

by Jan Obdrzalek , 2007
"... The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the modal µ-calculus. The known upper bound is NP∩co-NP, but no polynomial algorithm is known. It was shown that on tree-like g ..."
Abstract - Cited by 15 (0 self) - Add to MetaCart
The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the modal µ-calculus. The known upper bound is NP∩co-NP, but no polynomial algorithm is known. It was shown that on tree

Solving parity games on the gpu

by Michael Luttenberger - In Automated Technology for Verification and Analysis , 2013
"... 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 imple-mentations found in the widely known PGSolver collection of solvers. For benchmarking we use ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
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 imple-mentations found in the widely known PGSolver collection of solvers. For benchmarking we use

DAG-width and parity games

by Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer - IN PROCEEDINGS OF THE 23RD ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS , 2006
"... Tree-width is a well-known metric on undirected graphs that measures how tree-like a graph is and gives a notion of graph decomposition that proves useful in algorithm development. Tree-width is characterised by a game known as the cops-and-robber game where a number of cops chase a robber on the gr ..."
Abstract - Cited by 57 (9 self) - Add to MetaCart
to be useful in developing algorithms on directed graphs. In particular, we show that the problem of determining the winner of a parity game is solvable in polynomial time on graphs of bounded DAG-width. We also consider the relationship between DAG-width and other measures of such as entanglement and directed

Positional Determinacy of Parity Games

by Christoph Dittmann , 2015
"... We present a formalization of parity games (a two-player game on directed graphs) and a proof of their positional determinacy in Isabelle/HOL. This proof works for both finite and infinite games. We follow the proof in [2], which is based on [5]. ..."
Abstract - Add to MetaCart
We present a formalization of parity games (a two-player game on directed graphs) and a proof of their positional determinacy in Isabelle/HOL. This proof works for both finite and infinite games. We follow the proof in [2], which is based on [5].
Results 1 - 10 of 321