I
Igor Walukiewicz
Researcher at L'Abri
Publications - 11
Citations - 152
Igor Walukiewicz is an academic researcher from L'Abri. The author has contributed to research in topics: Decidability & Timed automaton. The author has an hindex of 6, co-authored 11 publications receiving 134 citations. Previous affiliations of Igor Walukiewicz include Centre national de la recherche scientifique.
Papers
More filters
Journal ArticleDOI
Choice functions and well-orderings over the infinite binary tree
TL;DR: A new proof is given showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree and how the result can be used to prove the inherent ambiguity of languages of infinite trees.
Book ChapterDOI
Lazy abstractions for timed automata
TL;DR: This work proposes an algorithm that dynamically updates LU-bounds during exploration of the search tree, and shows that on several standard benchmarks, the algorithm is capable of keeping very small LU- bounds, and in consequence is able to reduce the search space substantially.
Posted Content
The Complexity of Games on Higher Order Pushdown Automata
Thierry Cachat,Igor Walukiewicz +1 more
TL;DR: An n-EXPTIME lower bound is proved for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n, which matches the known upper bound for parity games on HPDA.
Book ChapterDOI
Weak Alternating Timed Automata
Paweł Parys,Igor Walukiewicz +1 more
TL;DR: The main result is a characterization of acceptance conditions for which the emptiness problem for the automata is decidable, which implies new decidability results for fragments of timed temporal logics.
Posted Content
Lazy abstractions for timed automata
TL;DR: In this article, the reachability problem for timed automata is considered, and an algorithm that is updating LU-bounds during exploration of the search tree is proposed, which can be seen as a kind of lazy CEGAR algorithm.