#### Filter Results:

- Full text PDF available (8)

#### Publication Year

2010

2017

- This year (1)
- Last 5 years (4)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Bernd Puchala
- MFCS
- 2010

We address the strategy problem for ω-regular two-player games with partial information, played on finite game graphs. We consider two different kinds of observability on a general model, a standard synchronous and an asynchronous one. In the asynchronous setting, moves which have no visible effect for a player are hidden completely from

- Dietmar Berwanger, Lukasz Kaiser, Bernd Puchala
- FSTTCS
- 2011

We present a general construction for eliminating imperfect information from games with several players who coordinate against nature, and to transform them into two-player games with perfect information while preserving winning strategy profiles. The construction yields an infinite game tree with epistemic models associated to nodes. To obtain a more… (More)

- Bernd Puchala
- 2013

- Bernd Puchala, Roman Rabinovich
- MFCS
- 2010

We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several measures for the complexity of graphs and analyze in which cases, bounding the measure decreases the complexity of the strategy problem on the corresponding classes of graphs. We prove or… (More)

- Wladimir Fridman, Bernd Puchala
- Acta Informatica
- 2011

We consider the distributed realizability problem for systems with regular and deterministic contextfree local specifications. We characterize exactly the architectures for which the realizability problem is decidable. This extends known results on local specifications in two directions. First, architectures with cycles are allowed instead of just acyclic… (More)

- Bernd Puchala, Roman Rabinovich
- ArXiv
- 2011

We investigate the interrelation between graph searching games and games with imperfect information. As key consequence we obtain that parity games with bounded imperfect information can be solved in Ptime on graphs of bounded DAG-width which generalizes several results for parity games on graphs of bounded complexity. We use a new concept of graph… (More)

- Bernd Puchala, Roman Rabinovich
- ArXiv
- 2017

We address the problem of solving parity games with imperfect information on finite graphs of bounded structural complexity. It is a major open problem whether parity games with perfect information can be solved in Ptime. Restricting the structural complexity of the game arenas, however, often leads to efficient algorithms for parity games. Such results are… (More)

We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several measures for the complexity of graphs and analyze in which cases, bounding the measure decreases the complexity of the strategy problem on the corresponding classes of graphs. We prove or… (More)

- Bernd Puchala
- 2013

This work adresses the strategy problem for multiplayer games with imperfect information which are of infinite duration and have (up to) contextfree winning conditions. A particular focus is on applications to synthesis of controllers for nonterminating reactive systems. Synthesis means that one tries to construct, from a formal model of the system and some… (More)

- Bernd Puchala, Roman Rabinovich
- Theor. Comput. Sci.
- 2016

- ‹
- 1
- ›