Working Papers
  1. H. Gimbert and W. Zielonka. Pure and Stationary Optimal Strategies in Perfect-Information Stochastic Games. 2009.
  2. B. Karelovic and W.Zielonka, Fixed Point Solution to Stochastic Priority Games 2017
Publications
  1. W. Zielonka. Playing in stochastic environment: from multi-armed bandits to two-player games. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010). volume 8 of Leibniz International Proceedings in Informatics (LIPIcs), pages 65-72, 2010. [ ]
  2. H. Gimbert and W. Zielonka. Blackwell-Optimal Strategies in Priority Mean- Payoff Games. Proceedings First Symposium on Games, Automata, Logic, and Formal Verification (GANDALF 2010). volume 25 of EPTCS, pages 7-21, 2010. [ ]
  3. H. Gimbert and W. Zielonka. Applying Blackwell optimality: priority mean-payoff games as limits of multi-discounted games. In Logic and Automata. History and Perspectives. volume 2 of Texts in Logic and Games, pages 331-355, 2007. Amsterdam University Press. []
  4. H. Gimbert and W. Zielonka. Perfect information stochastic priority games. In Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, volume 4596 of LNCS, pages 850-861, 2007. Springer. [] (long version [])
  5. H. Gimbert and W. Zielonka. Limits of multi-discounted Markov decision processes. In 22nd Annual IEEE Symposium on Logic in Computer Science, LICS 2007, Proceedings pages 89-98, 2007, IEEE Computer Society. []
  6. H. Gimbert and W. Zielonka. Deterministic priority mean-payoff games as limits of discounted games. In Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Proceedings, Part II, volume 4052 of LNCS, pages 312-323, 2006. Springer. []
  7. W. Zielonka. Time-stamps for Mazurkiewicz traces. Theor. Computer Science, 356(1-2):255-262, 2006. []
    The paper above comes with errata []
  8. J. Chalopin, Y. Métivier and W. Zielonka Local Computations in Graphs: The Case of Cellular Edge Local Computations. Fundamenta Informaticae, 74(1):85-114, 2006.
  9. W. Zielonka. An invitation to play. In Mathematical Foundations of Computer Science 2005, volume 3618 of LNCS, pages 58-70, 2005. Springer. []
  10. H. Gimbert and W. Zielonka. Games where you can play optimally without any memory. In CONCUR 2005, volume 3653 of LNCS, pages 428-442, 2005. Springer. []
  11. W. Zielonka. Perfect-information Stochastic Parity Games. In FOSSACS 2004, volume 2987 of LNCS, pages 499-513, 2004. Springer. []
  12. H. Gimbert and W. Zielonka. When Can You Play Positionally?. In Mathematical Foundations of Computer Science 2004, volume 3153 of LNCS, pages 686-697, 2004. Springer. []
  13. H. Gimbert and W. Zielonka. Discounting Infinite Games but How and Why?. In Luca de Alfaro, editor, Proceedings of the Workshop on Games in Design and Verification (GDV 2004), volume 119 of Electronic Notes in Theoretical Computer Science, pages 3-9, 2004. Elsevier. []
  14. J. Chalopin, Y. Métivier, and W. Zielonka. Election, naming and cellular edge local computations. In 2nd International Conference on Graph Transformation 2004, volume 3256 of LNCS, Roma, pages 242-256, 2004. Springer.
  15. W. Zielonka. Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theor. Computer Science, 200:135-183, 1998. []
  16. F. Demichelis and W. Zielonka. Controlled timed automata. In CONCUR'98, volume 1466 of LNCS, pages 455-469, 1998. Springer.
  17. I. Litovsky, Y. Métivier, and W. Zielonka. On the recognition of families of graphs with local computation. Information and Computation, 118(1):110-119, 1995.
  18. W. Zielonka. Asynchronous automata. In V. Diekert and G. Rozenberg, editors, The Book of Traces, chapter 7, pages 205-247. World Scientific, 1995. []
  19. P. Gastin, A. Petit, and W. Zielonka. An extension of Kleene's and Ochmanski's theorems to infinite traces. Theor. Computer Science, 125:167-204, 1994. []
  20. R. Cori, Y. Métivier, and W. Zielonka. Asynchronous mappings and asynchronous cellular automata. Information and Computation, 106(2):159-202, 1993. []
  21. M. Clerbout, M. Latteux, Y. Roos, and W. Zielonka. Semi-commutations and rational expressions. In ICALP'92, volume 623 of LNCS, pages 113-125, 1992. Springer.
  22. I. Litovsky, Y. Métivier, and W. Zielonka. The power and the limitations of local computations on graphs. In Graph Theoretic Concepts in Computer Science WG'92, volume 657 of LNCS, pages 333-345, 1992. Springer.
  23. P. Gastin, A. Petit, and W. Zielonka. A Kleene theorem for infinite trace languages. In ICALP'91, volume 510 of LNCS, pages 254-266, 1991. Springer.
  24. W. Zielonka. Safe executions of recognizable trace languages by asynchronous automata. In Logic at Botik'89, volume 363 of LNCS, pages 278-289, 1989. Springer. []
  25. W. Zielonka. Notes on finite asynchronous automata. RAIRO Informatique théorique et applications, 21(2):99-135, 1987. []



Last modified: May 07 15:30:04 2011