#### Filter Results:

- Full text PDF available (76)

#### Publication Year

1990

2017

- This year (4)
- Last 5 years (27)
- Last 10 years (49)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Igor Walukiewicz
- CAV
- 1996

A pushdown game is a two player perfect information infinite game on a transition graph of a pushdown automaton. A winning condition in such a game is defined in terms of states appearing infinitelyâ€¦ (More)

- David Janin, Igor Walukiewicz
- CONCUR
- 1996

Monadic second order logic (MSOL) over transition systems is considered. It is shown that every formula of MSOL which does not distinguish between bisimilar models is equivalent to a formula of theâ€¦ (More)

- David Janin, Igor Walukiewicz
- MFCS
- 1995

The propositional Î¼-calculus as introduced by Kozen in [4] is considered. The notion of disjunctive formula is defined and it is shown that every formula is semantically equivalent to a disjunctiveâ€¦ (More)

- AndrÃ© Arnold, Aymeric Vincent, Igor Walukiewicz
- Theor. Comput. Sci.
- 2003

The synthesis of controllers for discrete event systems, as introduced by Ramadge and Wonham, amounts to computing winning strategies in parity games. We show that in this framework it is possible toâ€¦ (More)

- Igor Walukiewicz
- LICS
- 1995

Propositional Î¼-calculus is an extension of the propositional modal logic with the least fixpoint operator. In the paper introducing the logic Kozen posed a question about completeness of theâ€¦ (More)

- Erich GrÃ¤del, Igor Walukiewicz
- LICS
- 1999

Guarded fixed point logics are obtained by adding least and greatest fixed points to the guarded fragments of firstorder logic that were recently introduced by AndrÃ©ka, van Benthem and NÃ©meti.â€¦ (More)

- Anca Muscholl, Igor Walukiewicz
- FoSSaCS
- 2007

A web service is modeled here as a finite state machine. A composition problem for web services is to decide if a given web service can be constructed from a given set of web services; where theâ€¦ (More)

- Igor Walukiewicz
- STACS
- 1996

An operation Mâˆ— which constructs from a given structure M a tree-like structure whose domain consists of the finite sequences of elements of M is considered. A notion of automata running on suchâ€¦ (More)

- Igor Walukiewicz
- FSTTCS
- 2000

A pushdown system is a graph G(P ) of configurations of a pushdown automaton P . The model checking problem for a logic L is: given a pushdown automaton P and a formula Î± âˆˆ L decide if Î± holds in theâ€¦ (More)

- P. S. Thiagarajan, Igor Walukiewicz
- LICS
- 1997

A basic result concerning LTL, the propositional temporal logic of linear time, is that it is expressively complete; it is equal in expressive power to the first order theory of sequences. We presentâ€¦ (More)