Filters








5,538 Hits in 2.3 sec

Benchmarks for Parity Games [chapter]

Jeroen J. A. Keiren
2015 Lecture Notes in Computer Science  
We propose a benchmark suite for parity games that includes the benchmarks that have been used in the literature, and make it available online.  ...  With this work we provide a starting point for further experimentation with parity games.  ...  Acknowledgements For generating the parity games described in the paper, a large number of tools have been used.  ... 
doi:10.1007/978-3-319-24644-4_9 fatcat:2ahawarizrhp3lrbaz62nujmhm

Benchmarks for Parity Games (extended version) [article]

Jeroen J.A. Keiren
2015 arXiv   pre-print
We propose a benchmark suite for parity games that includes all benchmarks that have been used in the literature, and make it available online.  ...  With this work we provide a starting point for further experimentation with parity games.  ...  Acknowledgements For generating the parity games described in the paper, a large number of tools have been used.  ... 
arXiv:1407.3121v2 fatcat:lefwv7otkfcjblw3e2abwlesb4

A workbench for preprocessor design and evaluation: toward benchmarks for parity games

Michael Huth, Nir Piterman, Huaxin Wang
2009 Electronic Communications of the EASST  
This workbench is aimed at facilitating two activities: to aid in the design, validation, and evaluation of preprocessors for parity game solvers; and to aid in the generation of benchmark parity games  ...  We describe a prototype workbench for the study of parity games and their solvers.  ...  Acknowledgements: This research was, in part, supported by the UK EPSRC project "Complete and Efficient Checks for Branching-Time Abstractions"(EP/E028985/1). Bibliography  ... 
doi:10.14279/tuj.eceasst.23.324 dblp:journals/eceasst/HuthPW09 fatcat:y5u3kqehkvgxxdhwwrjrkuonyi

Winning Cores in Parity Games

Steen Vester
2016 Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '16  
We also present a deterministic polynomial-time approximation algorithm for solving parity games based on computing winning cores.  ...  The algorithm returns under-approximations of the winning regions in parity games.  ...  A comparison of running times for some of the benchmarks can be seen below. These benchmarks are games designed to be difficult for some of the existing algorithms to solve.  ... 
doi:10.1145/2933575.2933589 dblp:conf/lics/Vester16 fatcat:r5wy4urbrbcklm22dvcainb5n4

A Solver for Modal Fixpoint Logics

Oliver Friedmann, Martin Lange
2010 Electronical Notes in Theoretical Computer Science  
Well-foundedness for unfoldings of least fixpoints is checked using deterministic parity automata. This reduces the satisfiability and validity problems to the problem of solving a parity game.  ...  MLSolver then uses a parity game solver in order to decide satisfiability and derives example models from the winning strategies in the parity game.  ...  The parity game is then solved using PGSolver, a highly efficient and configurable solver for parity games [10] .  ... 
doi:10.1016/j.entcs.2010.04.008 fatcat:lkcg5djjnzc3rjf6xdp4t3tfli

Fatal Attractors in Parity Games [chapter]

Michael Huth, Jim Huan-Pu Kuo, Nir Piterman
2013 Lecture Notes in Computer Science  
We study a new form of attractor in parity games and use it to define solvers that run in PTIME and are partial in that they do not solve all games completely.  ...  For one partial solver we prove that its runtime is in O(| V | 3 ), that its output game is independent of the order in which attractors are computed, and that it solves all Büchi games.  ...  But we here search for dynamic criteria that allow partial solvers to completely solve a range of benchmarks of parity games.  ... 
doi:10.1007/978-3-642-37075-5_3 fatcat:uxqp357lvjb7pi5jv7e552hg24

Strix: Explicit Reactive Synthesis Strikes Back! [chapter]

Philipp J. Meyer, Salomon Sickert, Michael Luttenberger
2018 Lecture Notes in Computer Science  
Strix is a new tool for reactive LTL synthesis combining a direct translation of LTL formulas into deterministic parity automata (DPA) and an efficient, multi-threaded explicit state solver for parity  ...  In brief, Strix (1) decomposes the given formula into simpler formulas, (2) translates these on-the-fly into DPAs based on the queries of the parity game solver, (3) composes the DPAs into a parity game  ...  Parity Game Solving.  ... 
doi:10.1007/978-3-319-96145-3_31 fatcat:f3gcoh23ujd3vadfvpmj3tqpga

Solving Parity Games in Practice [chapter]

Oliver Friedmann, Martin Lange
2009 Lecture Notes in Computer Science  
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  ...  In this paper we investigate practical aspects of solving parity games.  ...  Because of the absence of meaningful standardised parity game benchmarks we also evaluate the generic solver on random games. The benchmarking games are presented in detail in the following.  ... 
doi:10.1007/978-3-642-04761-9_15 fatcat:lbvjz7tbwzgjvhae3ykkala2ei

Improving parity games in practice

Antonio Di Stasio, Aniello Murano, Vincenzo Prignano, Loredana Sorrentino
2021 Annals of Mathematics and Artificial Intelligence  
In the last two decades, several algorithms for solving parity games have been proposed and implemented in , a platform written in OCaml. includes the Zielonka's recursive algorithm (, for short) which  ...  AbstractParity games are infinite-round two-player games played on directed graphs whose nodes are labeled with priorities.  ...  Previously, the best known algorithm for parity games was DD which could solve parity games in O(n √ n ), so this new result represents a significant advance in the understanding of parity games.  ... 
doi:10.1007/s10472-020-09721-3 fatcat:ymk2k5t7sjg6jl3ooepwgkgfxu

A Comparison of BDD-Based Parity Game Solvers

Lisette Sanchez, Wieger Wesselink, Tim A.C. Willemse
2018 Electronic Proceedings in Theoretical Computer Science  
We compare their performance on several types of random games and on a number of cases taken from the Keiren benchmark set.  ...  Parity games are two player games with omega-winning conditions, played on finite graphs. Such games play an important role in verification, satisfiability and synthesis.  ...  The Keiren Parity Game Solving Benchmark Set In [24] , Keiren describes and provides a set of parity games that originate from over 300 model checking problems, originating from 21 specifications.  ... 
doi:10.4204/eptcs.277.8 fatcat:76qxzmcteffbrpxvapewuqgwty

The Fixpoint-Iteration Algorithm for Parity Games

Florian Bruse, Michael Falk, Martin Lange
2014 Electronic Proceedings in Theoretical Computer Science  
It is known that the model checking problem for the modal mu-calculus reduces to the problem of solving a parity game and vice-versa.  ...  This is also one of the few algorithms, if not the only one, that were not originally devised for parity game solving already.  ...  Solving Parity Games by Fixpoint Iteration Algorithm 1 takes a finite parity game and returns the winning region for player Even in this game.  ... 
doi:10.4204/eptcs.161.12 fatcat:72lyenyssfb6rni6xccvuztbuu

Static Analysis of Parity Games: Alternating Reachability Under Parity [chapter]

Michael Huth, Jim Huan-Pu Kuo, Nir Piterman
2015 Lecture Notes in Computer Science  
We here mean to provide such robust foundations for deeper analysis through a new form of game, alternating reachability under parity.  ...  We prove the determinacy of these games and use this determinacy to define, for each player, a monotone fixed point over an ordered domain of height linear in the size of the parity game such that all  ...  structured benchmarks.  ... 
doi:10.1007/978-3-319-27810-0_8 fatcat:co2qjkdsunhnrjzc32bklgutcy

Fatal Attractors in Parity Games: Building Blocks for Partial Solvers [article]

Michael Huth, Jim Huan-Pu Kuo, Nir Piterman
2014 arXiv   pre-print
Attractors in parity games are a technical device for solving "alternating" reachability of given node sets.  ...  For one partial solver we prove that its run-time is at most cubic in the number of nodes in the parity game, that its output game is independent of the order in which monotone attractors are computed,  ...  But we here search for algorithmic building blocks from which we can construct efficient partial solvers that completely solve a range of benchmarks of parity games.  ... 
arXiv:1405.0386v2 fatcat:2psoi2zpirdghedq67ip4hooc4

Winning Cores in Parity Games [article]

Steen Vester
2016 arXiv   pre-print
We introduce the novel notion of winning cores in parity games and develop a deterministic polynomial-time under-approximation algorithm for solving parity games based on winning core approximation.  ...  In particular, we show that the winning core and the winning region for a player in a parity game are equivalently empty.  ...  Fig. 8 . 8 A partial solver for parity games based on winning cores Fig. 10 . 10 Performance for benchmark games. Fig. 11 . 11 Performance for benchmark games. Table 1.  ... 
arXiv:1602.01963v1 fatcat:wex2ovt2mjhitfffk3fobve6fe

Solving Parity Games Using An Automata-Based Algorithm [article]

Antonio Di Stasio, Aniello Murano, Giuseppe Perelli, Moshe Y. Vardi
2019 arXiv   pre-print
Parity games are abstract infinite-round games that take an important role in formal verification.  ...  More precisely, we consider an algorithm introduced by Kupferman and Vardi that solves a parity game by solving the emptiness problem of a corresponding alternating parity automaton.  ...  By means of benchmarks based on random games, we show that it is the best performing algorithm for solving parity games when the number of priorities is very small w.r.t. the number of states.  ... 
arXiv:1910.13765v1 fatcat:66dhrppylvb5faobu4bbhqeu6e
« Previous Showing results 1 — 15 out of 5,538 results