Sciweavers

1599 search results - page 8 / 320
» Algorithms for Parity Games
Sort
View
FSTTCS
2008
Springer
14 years 10 months ago
On the Power of Imperfect Information
We present a polynomial-time reduction from parity games with imperfect information to safety games with imperfect information. Similar reductions for games with perfect informatio...
Dietmar Berwanger, Laurent Doyen
87
Voted
IPCO
2010
125views Optimization» more  IPCO 2010»
14 years 11 months ago
A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
SPIN
2010
Springer
14 years 8 months ago
Analysing Mu-Calculus Properties of Pushdown Systems
Pushdown systems provide a natural model of software with recursive procedure calls. We provide a tool implementing an algorithm for computing the winning regions of a pushdown par...
Matthew Hague, C.-H. Luke Ong
60
Voted
HPCC
2005
Springer
15 years 3 months ago
A New Parity Space Approach to Fault Detection for General Systems
This paper proposes a new parity space approach to a fault detection for general systems with noises, actuator faults and sensor faults. The proposed parity space approach could be...
Pyung Soo Kim, Eung Hyuk Lee
CAV
2009
Springer
155views Hardware» more  CAV 2009»
15 years 10 months ago
Better Quality in Synthesis through Quantitative Objectives
Abstract. Most specification languages express only qualitative constraints. However, among two implementations that satisfy a given specification, one may be preferred to another....
Roderick Bloem, Krishnendu Chatterjee, Thomas A. H...