Igor Walukiewicz

Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz: Lazy abstractions for timed automata. CoRR abs/1301.3127 (2013)

Pawel Parys, Igor Walukiewicz: Weak Alternating Timed Automata. Logical Methods in Computer Science 8(3) (2012)

Mikolaj Bojanczyk, Howard Straubing, Igor Walukiewicz: Wreath Products of Forest Algebras, with Applications to Tree Logics. Logical Methods in Computer Science 8(3) (2012)

Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz: Efficient emptiness check for timed Büchi automata. Formal Methods in System Design 40(2): 122-146 (2012)

B. Srivathsan, Igor Walukiewicz: An alternate proof of Statman's finite completeness theorem. Inf. Process. Lett. 112(14-15): 612-616 (2012)

Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz: Better Abstractions for Timed Automata. LICS 2012: 375-384

Igor Walukiewicz: Simple Models for Recursive Schemes. MFCS 2012: 49-60

Sylvain Salvati, Igor Walukiewicz: Recursive Schemes, Krivine Machines, and Collapsible Pushdown Automata. RP 2012: 6-20

Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz: Asynchronous Games over Tree Architectures. CoRR abs/1204.0077 (2012)

Frédéric Herbreteau, Dileep Kini, B. Srivathsan, Igor Walukiewicz: Using non-convex approximations for efficient analysis of timed automata. FSTTCS 2011: 78-89

Sylvain Salvati, Igor Walukiewicz: Krivine Machines and Higher-Order Schemes. ICALP (2) 2011: 162-173

Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz: Efficient Emptiness Check for Timed Büchi Automata (Extended version). CoRR abs/1104.1540 (2011)

Frédéric Herbreteau, Dileep Kini, B. Srivathsan, Igor Walukiewicz: Using non-convex approximations for efficient analysis of timed automata. CoRR abs/1110.3704 (2011)

Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz: Better abstractions for timed automata. CoRR abs/1110.3705 (2011)

Igor Walukiewicz: Synthesis: Words and Traces. ATVA 2010: 18-21

Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz: Efficient Emptiness Check for Timed Büchi Automata. CAV 2010: 148-161

Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz: Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata. ICALP (2) 2010: 52-63

Pawel Parys, Igor Walukiewicz: Weak Alternating Timed Automata. ICALP (2) 2009: 273-284

Mikolaj Bojanczyk, Howard Straubing, Igor Walukiewicz: Wreath Products of Forest Algebras, with Applications to Tree Logics. LICS 2009: 255-263

Anca Muscholl, Igor Walukiewicz: A Lower Bound on Web Services Composition. Logical Methods in Computer Science 4(2) (2008)

Andrzej S. Murawski, Igor Walukiewicz: Third-order Idealized Algol with iteration is decidable. Theor. Comput. Sci. 390(2-3): 214-229 (2008)

Slawomir Lasota, Igor Walukiewicz: Alternating timed automata. ACM Trans. Comput. Log. 9(2) (2008)

André Arnold, Igor Walukiewicz: Nondeterministic controllers of nondeterministic processes. Logic and Automata 2008: 29-52

Mikolaj Bojanczyk, Igor Walukiewicz: Forest algebras. Logic and Automata 2008: 107-132

Igor Walukiewicz: Finding Your Way in a Forest: On Different Types of Trees and Their Properties. FoSSaCS 2008: 1-4

Luca Aceto, Ivan Damgård, Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir, Igor Walukiewicz (Eds.): Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games. Lecture Notes in Computer Science 5125, Springer 2008, isbn 978-3-540-70574-1

Luca Aceto, Ivan Damgård, Leslie Ann Goldberg, Magnús M. Halldórsson, Anna Ingólfsdóttir, Igor Walukiewicz (Eds.): Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II - Track B: Logic, Semantics, and Theory of Programming & Track C: Security and Cryptography Foundations. Lecture Notes in Computer Science 5126, Springer 2008, isbn 978-3-540-70582-6

Anca Muscholl, Igor Walukiewicz: A lower bound on web services composition. CoRR abs/0804.3105 (2008)

Anca Muscholl, Igor Walukiewicz: A Lower Bound on Web Services Composition. FoSSaCS 2007: 274-286

Patrick Chervet, Igor Walukiewicz: Minimizing Variants of Visibly Pushdown Automata. MFCS 2007: 135-146

Thierry Cachat, Igor Walukiewicz: The Complexity of Games on Higher Order Pushdown Automata. CoRR abs/0705.0262 (2007)

Erich Grädel, Igor Walukiewicz: Positional Determinacy of Games with Infinitely Many Priorities. Logical Methods in Computer Science 2(4) (2006)

Mikolaj Bojanczyk, Igor Walukiewicz: Characterizing EF and EX tree logics. Theor. Comput. Sci. 358(2-3): 255-272 (2006)

Erich Grädel, Igor Walukiewicz: Postinal Determinacy of Games with Infinitely Many Priorities. CoRR abs/cs/0610034 (2006)

Erich Grädel, Igor Walukiewicz: Positional Determinacy of Games with Infinitely Many Priorities. CoRR abs/cs/0610035 (2006)

Damian Niwinski, Igor Walukiewicz: Deciding Nondeterministic Hierarchy of Deterministic Tree Automata. Electr. Notes Theor. Comput. Sci. 123: 195-208 (2005)

Igor Walukiewicz: Difficult Configurations-On the Complexity of LTrL. Formal Methods in System Design 26(1): 27-43 (2005)

Anca Muscholl, Igor Walukiewicz: An NP-complete fragment of LTL. Int. J. Found. Comput. Sci. 16(4): 743-753 (2005)

Igor Walukiewicz: Preface. ITA 39(3): 421-422 (2005)

Andrzej S. Murawski, Igor Walukiewicz: Third-Order Idealized Algol with Iteration Is Decidable. FoSSaCS 2005: 202-218

Slawomir Lasota, Igor Walukiewicz: Alternating Timed Automata. FoSSaCS 2005: 250-265

Igor Walukiewicz: From Logic to Games. FSTTCS 2005: 79-91

Andrzej S. Murawski, C.-H. Luke Ong, Igor Walukiewicz: Idealized Algol with Ground Recursion, and DPDA Equivalence. ICALP 2005: 917-929

Teodor Knapik, Damian Niwinski, Pawel Urzyczyn, Igor Walukiewicz: Unsafe Grammars and Panic Automata. ICALP 2005: 1450-1461

Slawomir Lasota, Igor Walukiewicz: Alternating Timed Automata. CoRR abs/cs/0512031 (2005)

Zoltán Ésik, Igor Walukiewicz: Foreword. ITA 38(4): 275-276 (2004)

Mikolaj Bojanczyk, Igor Walukiewicz: Characterizing EF and EX Tree Logics. CONCUR 2004: 131-145

Anca Muscholl, Igor Walukiewicz: An NP-Complete Fragment of LTL. Developments in Language Theory 2004: 334-344

Igor Walukiewicz: A Landscape with Games in the Backgroun. LICS 2004: 356-366

Igor Walukiewicz: How to Fix It: Using Fixpoints in Different Contexts. LPAR 2004: 184-193

Igor Walukiewicz (Ed.): Foundations of Software Science and Computation Structures, 7th International Conference, FOSSACS 2004, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004, Barcelona, Spain, March 29 - April 2, 2004, Proceedings. Lecture Notes in Computer Science 2987, Springer 2004, isbn 3-540-21298-1

André Arnold, Aymeric Vincent, Igor Walukiewicz: Games for synthesis of controllers with partial observation. Theor. Comput. Sci. 1(303): 7-34 (2003)

Damian Niwinski, Igor Walukiewicz: A gap property of deterministic tree languages. Theor. Comput. Sci. 1(303): 215-231 (2003)

Igor Walukiewicz: Winning Strategies and Synthesis of Controllers (Tutorial). CSL 2003: 574

Alexis-Julien Bouquet, Olivier Serre, Igor Walukiewicz: Pushdown Games with Unboundedness and Regular Conditions. FSTTCS 2003: 88-99

Swarup Mohalik, Igor Walukiewicz: Distributed Games. FSTTCS 2003: 338-351

Igor Walukiewicz: Deciding low levels of tree-automata hierarchy. Electr. Notes Theor. Comput. Sci. 67: 61-75 (2002)

Igor Walukiewicz: Describing properties of concurrent systems (Logic for Traces) (invited talk). Electr. Notes Theor. Comput. Sci. 68(2): 69 (2002)

P. S. Thiagarajan, Igor Walukiewicz: An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces. Inf. Comput. 179(2): 230-249 (2002)

Jakub Neumann, Andrzej Szepietowski, Igor Walukiewicz: Complexity of weak acceptance conditions in tree automata. Inf. Process. Lett. 84(4): 181-187 (2002)

Julien Bernet, David Janin, Igor Walukiewicz: Permissive strategies: from parity games to safety games. ITA 36(3): 261-275 (2002)

Igor Walukiewicz: Local Logics for Traces. Journal of Automata, Languages and Combinatorics 7(2): 259-290 (2002)

Igor Walukiewicz: Monadic second-order logic on tree-like structures. Theor. Comput. Sci. 275(1-2): 311-346 (2002)

Igor Walukiewicz: Automata and Games for Synthesis. AMAST 2002: 15-20

Igor Walukiewicz: Pushdown Processes: Games and Model-Checking. Inf. Comput. 164(2): 234-263 (2001)

Igor Walukiewicz: Completeness of Kozen's Axiomatisation of the Propositional µ-Calculus. Inf. Comput. 157(1-2): 142-182 (2000)

Igor Walukiewicz: Model Checking CTL Properties of Pushdown Systems. FSTTCS 2000: 127-138

Erich Grädel, Igor Walukiewicz: Guarded Fixed Point Logic. LICS 1999: 45-54

Bruno Courcelle, Igor Walukiewicz: Monadic Second-Order Logic, Graph Coverings and Unfoldings of Transition Systems. Ann. Pure Appl. Logic 92(1): 35-62 (1998)

Igor Walukiewicz: Difficult Configurations - On the Complexity of LTrL. ICALP 1998: 140-151

Witold Charatonik, David A. McAllester, Damian Niwinski, Andreas Podelski, Igor Walukiewicz: The Horn Mu-calculus. LICS 1998: 58-69

Damian Niwinski, Igor Walukiewicz: Relating Hierarchies of Word and Tree Automata. STACS 1998: 320-331

Stefan Dziembowski, Marcin Jurdzinski, Igor Walukiewicz: How Much Memory is Needed to Win Infinite Games? LICS 1997: 99-110

P. S. Thiagarajan, Igor Walukiewicz: An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces. LICS 1997: 183-194

Igor Walukiewicz: A note on the completeness of Kozen's axiomatisation of the propositional mu-calculus. Bulletin of Symbolic Logic 2(3): 349-366 (1996)

Damian Niwinski, Igor Walukiewicz: Games for the mu-Calculus. Theor. Comput. Sci. 163(1&2): 99-116 (1996)

Igor Walukiewicz: Pushdown Processes: Games and Model Checking. CAV 1996: 62-74

David Janin, Igor Walukiewicz: On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic. CONCUR 1996: 263-277

Igor Walukiewicz: Monadic Second Order Logic on Tree-Like Structures. STACS 1996: 401-413

Igor Walukiewicz: Completeness of Kozen's Axiomatisation of the Propositional mu-Calculus. LICS 1995: 14-24

David Janin, Igor Walukiewicz: Automata for the Modal mu-Calculus and related Results. MFCS 1995: 552-562

Igor Walukiewicz: Gentzen-Type Axiomatization for PAL. Theor. Comput. Sci. 118(1): 67-79 (1993)

Igor Walukiewicz: On Completeness of the mu-calculus. LICS 1993: 136-146

Igor Walukiewicz: Decision Procedure for Checking Validity of PAL Formulas. IMYCS 1990: 288-298

Igor Walukiewicz: Gentzen Type Axiomatizations for PAL. MFCS 1990: 499-507