On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic D Janin, I Walukiewicz International Conference on Concurrency Theory, 263-277, 1996 | 414 | 1996 |

Pushdown processes: Games and model-checking I Walukiewicz Information and computation 164 (2), 234-263, 2001 | 315 | 2001 |

Completeness of Kozen's axiomatisation of the propositional μ-calculus I Walukiewicz Information and Computation 157 (1-2), 142-182, 2000 | 314* | 2000 |

Automata for the modal μ-calculus and related results D Janin, I Walukiewicz International Symposium on Mathematical Foundations of Computer Science, 552-562, 1995 | 290 | 1995 |

Games for synthesis of controllers with partial observation A Arnold, A Vincent, I Walukiewicz Theoretical computer science 303 (1), 7-34, 2003 | 281 | 2003 |

Pushdown processes: Games and model checking I Walukiewicz International Conference on Computer Aided Verification, 62-74, 1996 | 239 | 1996 |

Guarded fixed point logic E Gradel, I Walukiewicz Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158 …, 1999 | 224 | 1999 |

How much memory is needed to win infinite games? S Dziembowski, M Jurdzinski, I Walukiewicz Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science …, 1997 | 167 | 1997 |

Monadic second-order logic on tree-like structures I Walukiewicz Theoretical computer science 275 (1-2), 311-346, 2002 | 163 | 2002 |

Games for the μ-calculus D Niwiński, I Walukiewicz Theoretical Computer Science 163 (1-2), 99-116, 1996 | 123 | 1996 |

Model checking CTL properties of pushdown systems I Walukiewicz International Conference on Foundations of Software Technology and …, 2000 | 113 | 2000 |

An expressively complete linear time temporal logic for Mazurkiewicz traces PS Thiagarajan, I Walukiewicz Information and Computation 179 (2), 230-249, 2002 | 109 | 2002 |

Permissive strategies: from parity games to safety games J Bernet, D Janin, I Walukiewicz RAIRO-Theoretical Informatics and Applications 36 (3), 261-275, 2002 | 109 | 2002 |

On completeness of the mu-calculus I Walukiewicz [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science …, 1993 | 104 | 1993 |

Forest algebras M laj Bojanczyk, I Walukiewicz Automata and logic: history and perspectives, 107-132, 2008 | 103 | 2008 |

Monadic second-order logic, graph coverings and unfoldings of transition systems B Courcelle, I Walukiewicz Annals of Pure and Applied Logic 92 (1), 35-62, 1998 | 97 | 1998 |

Monadic second order logic on tree-like structures I Walukiewicz Annual Symposium on Theoretical Aspects of Computer Science, 399-413, 1996 | 93 | 1996 |

Distributed games S Mohalik, I Walukiewicz International Conference on Foundations of Software Technology and …, 2003 | 89 | 2003 |

Alternating timed automata S Lasota, I Walukiewicz ACM Transactions on Computational Logic (TOCL) 9 (2), 1-27, 2008 | 85 | 2008 |

The mu-calculus and model checking J Bradfield, I Walukiewicz Handbook of Model Checking, 871-919, 2018 | 81 | 2018 |