Zobrazeno 1 - 6
of 6
pro vyhledávání: '"OLSCHEWSKI, JÖRG"'
We study nondeterministic strategies in parity games with the aim of computing a most permissive winning strategy. Following earlier work, we measure permissiveness in terms of the average number/weight of transitions blocked by the strategy. Using a
Externí odkaz:
http://arxiv.org/abs/1102.3615
Autor:
Olschewski, Jörg, Ummels, Michael
We study several problems related to finding reset words in deterministic finite automata. In particular, we establish that the problem of deciding whether a shortest reset word has length k is complete for the complexity class DP. This result answer
Externí odkaz:
http://arxiv.org/abs/1004.3246
Autor:
Olschewski, Jörg
Publikováno v:
Aachen : Publikationsserver der RWTH Aachen University VI, 117 S. : graph. Darst. (2013). = Aachen, Techn. Hochsch., Diss., 2013
The theory of two-player infinite games provides a framework for studying the controller synthesis problem in reactive system. This problem was solved for regular winning conditions for the first time by the fundamental Büchi-Landweber Theorem. The
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______791::e116035d5befb24cb7a3cc793e71748d
https://publications.rwth-aachen.de/record/229420
https://publications.rwth-aachen.de/record/229420
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Foundations of Software Science & Computational Structures (9783642287282); 2012, p150-164, 15p
Publikováno v:
International Journal of Foundations of Computer Science. Aug2012, Vol. 23 Issue 5, p985-1000. 16p.