2012

  • J. Fearnley and M. Zimmermann. Playing Muller Games in a Hurry. 2012. Accepted for publication in International Journal of Foundations of Computer Science, 2012. World Scientific Publishing Company. PDF.

2011

  • Thomas Brihaye, Véronique Bruyère, Hugo Gimbert and Julie De Pril. Subgame Perfection for Equilibria in Quantitative Reachability Games. Technical Report. PDF.
  • Thomas Brihaye, Véronique Bruyère and Julie De Pril. On Equilibria in Quantitative Games with Reachability/Safety Objectives. Submitted. PDF.
  • Michal Rutkowski.Two-player reachability-price games on single-clock timed automata. Proceedings of the Ninth Workshop on Quantitative Aspects of Programming Languages. EPTCS 57. pp. 31-46. 2011.
  • John Fearnley, Oded Lachish. Parity Games on Graphs with Medium Tree-Width. Mathematical Foundations of Computer Science (MFCS'11). LNCS 6907. po. 303-314, Springer.
  • Uli Fahrenberg, Line Juhl, Kim G. Larsen and Jiri Srba. Energy Games in Multiweighted Automata. 2011.
  • Sebastian Bauer, Uli Fahrenberg, Line Juhl, Kim G. Larsen, Axel Legay and Claus Thrane. Quantitative Refinement for Weighted Modal Transition Systems. Proceedings of MFCS. Springer-Verlag LNCS. Volume 6907. 2011.
  • Kim G. Larsen, Uli Fahrenberg and Claus Thrane. Metrics for weighted transition systems: Axiomatization and complexity. Theoretical Computer Science. Volume 412, number 28, pp. 3358-3369.
  • Uli Fahrenberg, Claus Thrane and Kim G. Larsen. Distances for Weighted Transition Systems: Games and Properties. In Proceedings of Ninth Workshop on Quantitative Aspects of Programming Languages (QAPL'11). Electronic Proceedings in Theoretical Computer Science. 2011.
  • N. Benes, J. Kretinsky, K.G. Larsen, M.H. Møller and J. Srba. Parametric Modal Transition Systems. Proceedings of the 9th International Symposium on Automated Technology for Verification and Analysis ({ATVA}'11). Springer LNCS. 2011.
  • Timothy Bourke, Alexandre David, Kim. G. Larsen, Axel Legay, Didier Lime, Ulrik Nyman and Andrzej Wasowski. New Results on Timed Specifications. Post-proceedings of WADT 2010. 2011.
  • Patricia Bouyer and Uli Fahrenberg and Kim G. Larsen and Nicolas Markey.Quantitative Modeling and Analysis of Embedded Systems. 2011. Communications of the ACM, Invited paper.
  • Arnaud Carayol, Axel Haddad and Olivier Serre. Qualitative Tree Languages, in Twenty-Sixth Annual IEEE Symposium on Logic in Computer Science (LICS 2011), pp.13-22, 2011.
  • P. Bouyer, R. Brenguier, N. Markey and M. Ummels. Nash Equilibria in Concurrent Games with Büchi Objectives. In FSTTCS'11, to appear.
  • W. Thomas. Infinite games and uniformization. In M. Banerjee and A. Seth, editors, Proceedings of the 4th Indian Conference on Logic and Its Applications, ICLA 2011, volume 6521 of Lecture Notes in Computer Science, pages 19-21. Springer, 2011. PDF.
  • Sten Grüner, Frank G. Radmacher, and Wolfgang Thomas. Connectivity games over dynamic networks. In Proceedings of the 2nd International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2011, volume 54 of Electronic Proceedings in Theoretical Computer Science, pages 131-145, 2011. PDF.
  • M. Zimmermann. Optimal Bounds in Parametric LTL Games. In G. D'Agostino and S. La Torre, editors, Proceedings of the Second International Symposium on Games, Automata, Logic, and Formal Verification, GandALF 2011, volume 54, pages 146-161. Electronic Proceedings in Theoretical Computer Science, 2011. PDF.
  • D. Neider, R. Rabinovich, and M. Zimmermann. Solving Muller Games via Safety Games. Technical Report AIB-2011-14, RWTH Aachen, 2011. PDF.
  • W. Fridman, C. Löding, and M. Zimmermann. Degrees of Lookahead in Context-free Infinite Games. In Marc Bezem, editor, Computer Science Logic (CSL'11) - 25th International Workshop/20th Annual Conference of the EACSL, volume 12 of Leibniz International Proceedings in Informatics (LIPIcs), pages 264-276, Dagstuhl, Germany, 2011. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. PDF.
  • Patricia Bouyer, Nicolas Markey, Jörg Olschewski, and Michael Ummels. Measuring permissiveness in parity games: Mean-payoff parity games revisited. In Automated Technology for Verification and Analysis, volume 6996 of Lecture Notes in Computer Science. Springer, 2011. PDF.
  • N. Chaturvedi, J. Olschewski, and W. Thomas. Languages vs. omega-languages in regular infinite games. In Giancarlo Mauri and Alberto Leporati, editors, Proceedings of the 15th International Conference on Developments in Langauge Theory, DLT 2011, volume 6795 of Lecture Notes in Computer Science, pages 180-191. Springer, 2011. PDF.
  • Emmanuel Filiot, Naiyong Jin and Jean-François Raskin. Antichains and Compositional Algorithms for LTL Synthesis. Journal of Formal Methods in System Design. Springer link, PDF.
  • Thomas Brihaye, Véronique Bruyère, Laurent Doyen, Marc Ducobu, Jean-François Raskin. Antichain-based QBF Solving. To appear in ATVA'11. PDF.

2010

  • John Fearnley, Marcin Jurdzinski, Rahul Savani. Linear complementarity algorithms for infinite games. SOFSEM 2010: Theory and Practice of Computer Science. LNCS 5901. pp. 382-393. Springer. 2010.
  • Michał Rutkowski, Ranko Lazić and Marcin Jurdziński. Average-price-per-reward games on hybrid automata with strong resets. International Journal on Software Tools for Technology Transfer. Online First.
  • John Fearnley. Non-oblivious Strategy Improvement. Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'10). LNCS 6355. pp. 212-230. Springer. 2010.
  • John Fearnley. Exponential lower bounds for policy iteration. Automata, Languages and Programming (ICALP'10 Part II). LNCS 6199. pp. 551-562. Springer. 2010.
  • Kim Guldstrand Larsen, Shuhao Li, Brian Nielsen, Saulius Pusinskas. Scenario-Based Analysis and Synthesis of Real-Time Systems Using Uppaal. Proc. 13th Conf. on Design, Automation and Test in Europe (DATE'10). IEEE.
  • Alexandre David, Kim G. Larsen, Axel Legay, Ulrik Nyman and Andrzej Wasowski/ ECDAR: An Environment for Compositional Design and Analysis of Real Time Systems. Proceedings of 8th International Symposium on Automated Technology for Verification and Analysis (ATVA). 2010.
  • Alexandre David, Kim G. Larsen, Axel Legay, Ulrik Nyman and Andrzej Wasowski. Timed I/O automata: a complete specification theory for real-time systems. Proceedings of the 13th ACM International Conference on Hybrid Systems (HSCC). 2010. pp. 91-100.
  • Alexandre David, Kim G. Larsen, Axel Legay, Ulrik Nyman and Andrzej Wasowski. An Interface Theory for Timed Systems (abstract). Presented at the 20th International Workshop on Algebraic Development Techniques WADT. 2010}.
  • Patricia Bouyer, Uli Fahrenberg, Kim G. Larsen and Nicolas Markey. Timed automata with observers under energy constraints. Proceedings of the 13th ACM International Conference on Hybrid Systems: Computa tion and Control, HSCC. 2010. pp. 61-70.
  • P. Bouyer, R. Brenguier and N. Markey. Nash Equilibria for Reachability Objectives in Multi-player Timed Games. In CONCUR'10, LNCS 6269, pages 192-206. Springer, 2010. PDF.
  • P. Bouyer, R. Brenguier and N. Markey. Computing Equilibria in Two-Player Timed Games via Turn-Based Finite Games. In FORMATS'10, LNCS 6246, pages 62-76. Springer, 2010. PDF.
  • A. Da Costa, F. Laroussinie and N. Markey. ATL with strategy contexts: Expressiveness and Model Checking. In FSTTCS'10, Leibniz International Proceedings in Informatics 8, pages 120-132. Leibniz-Zentrum für Informatik, 2010. PDF.
  • D. Berwanger, K. Chatterjee, L. Doyen, M. De Wulf and Th. A. Henzinger. Strategy Construction for Parity Games with Imperfect Information. Information and Computation 208(10), pages 1206-1220, 2010. PDF.
  • Dominik Klein, Frank G. Radmacher, and Wolfgang Thomas. Moving in a network under random failures: A complexity analysis. Science of Computer Programming, Article in Press, Elsevier, 2010. PDF.
  • Michael Holtmann, Łukasz Kaiser, and Wolfgang Thomas. Degrees of Lookahead in Regular Infinite Games. In Luke Ong, editor, Foundations of Software Science and Computational Structures, volume 6014 of Lecture Notes in Computer Science, pages 252-266. Springer, 2010. PDF.
  • James Gross, Frank G. Radmacher, and Wolfgang Thomas. A game-theoretic approach to routing under adversarial conditions. In Proceedings of the 6th IFIP International Conference on Theoretical Computer Science, IFIP TCS 2010, volume 323 of IFIP Advances in Information and Communication Technology, pages 355-370. Springer, 2010. PDF.
  • W. Fridman, C. Löding, and M. Zimmermann. Degrees of Lookahead in Context-free Infinite Games. Technical Report AIB-2010-20, RWTH Aachen, December 2010. PDF.
  • B. Puchala and R. Rabinovich. Parity Games with Partial Information Played on Graphs of Bounded Complexity. In Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science 2010, MFCS '10, vol. 6281 of LNCS, pp. 604–615. Springer, 2010. PDF.
  • Jörg Olschewski and Michael Ummels. The complexity of finding reset words in finite automata. In Mathematical Foundations of Computer Science 2010, volume 6281 of Lecture Notes in Computer Science, pages 568-579. Springer, 2010. PDF.
  • J. Fearnely and M. Zimmermann. Playing Muller Games in a Hurry. Proceedings of the First Symposium on Games, Automata, Logic, and Formal Verification, GandALF 2010, volume 25. Electronic Proceedings in Theoretical Computer Science, 2010. PDF
  • M. Zimmermann. Parametric LTL Games. Technical Report AIB-2010-11, RWTH Aachen, 2010. PDF
  • Thomas Brihaye, Véronique Bruyère, Julie De Pril. Equilibria in Quantitative Reachability Games. CSR 2010, LNCS 6072, pp.72-83, Springer.
  • Lubos Brim, Jakub Chaloupka, Laurent Doyen, Rafaella Gentilini, and Jean-François Raskin. Faster Algorithms for Mean-Payoff Games. 19 pages. January, 2010. Submitted.
  • Emmanuel Filiot, Tristan Le Gall, Jean-François Raskin. Regret Minimization in Game Graphs. 15 pages. To appear in MFCS'2010.
  • Emmanuel Filiot, Nayiong Jin, and Jean-François Raskin. Compositional Algorithms for LTL Synthesis. To appear in ATVA'2010. LNCS Springer.
  • Aldric Degorre, Laurent Doyen, Raffaella Gentilini, Jean-François Raskin, and Szymon Torunczyk. Energy and Mean-Payoff Games with Imperfect Information. 12 pages. To appear in CSL'2010. LNCS Springer.
  • Laurent Doyen and Jean-François Raskin. Antichain Algorithms for Finite Automata. To appear in TACAS2010, LNCS, Springer 20 pages. 2010. LNCS Springer.
  • Laurent Doyen and Jean-François Raskin. Games with Imperfect Information: Theory and Algorithms. Lecture notes for the summer school "Games". 25 pages. To appear in Cambridge University Press. 2010.
  • Adam Antonik, Michael Huth, Kim G. Larsen, Ulrik Nyman and Andrzej Wasowski. Modal and Mixed Specifications: Key Decision Problems and their Complexities. Mathematical Structures in Computer Science. Volume 20, number 1, pp. 75-103. 2010.
  • Uli Fahrenberg, Kim G. Larsen and Claus Thrane. A Quantitative Characterization of Weighted Kripke Structures in Temporal Logic. Computing and Informatics. Volume 29, pp. 1311-1324. 2010.

2009

  • Alexandre David, Kim G. Larsen, Shuhao Li and Brian Nielsen. Timed Testing under Partial Observability. ICST '09: Proceedings of the 2009 International Conference on Software Testing Verification and Validation. 2009. IEEE.
  • Line Juhl, Kim G. Larsen and Jiri Srba. Modal Transition Systems with Weight Intervals. Journal of Logic and Algebraic Programming. Special issue: NWPT 2009.
  • Claus Thrane, Uli Fahrenberg and Kim G. Larsen. Quantitative Analysis of Weighted Transition Systems. Journal of Logic and Algebraic Programming. 2009.
  • Nikola Benes, Jan Kretinsky, Kim G. Larsen and Jiri Srba. Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete. 6th International Colloquium on Theoretical Aspects of Computing (ICTAC'09). 2009.
  • N. Bene, J. Ketínský, K. G. Larsen and J. Srba. On Determinism in Modal Transition Systems. Theoretical Computer Science. Elsevier. 2009. Volume 410, number 41, pp. 4026--4043.
  • A. David and K.G. Larsen and U. Nyman and A. Legay and A. Wasowski. Methodologies for Specification of Real-Time Systems Using Timed I/O Automata. Formal Methods for Components and Objects - 8th International Symposium, (FMCO'09). pp. 290-310. 2009. Springer LNCS.
  • E. Grädel, Ł. Kaiser, and R. Rabinovich. Directed Graphs of Entanglement Two. In Proceedings of the 17th International Symposium on Fundamentals of Computation Theory, FCT '09, vol. 5699 of LNCS, pp. 169–181. Springer, 2009. PDF.
  • Laurent Doyen, Gilles Geeraerts, Jean-François Raskin, and Julien Reichert. Realizability of Real-time Logics. In FORMATS09, LNCS 5813, Springer, pp.133-148 2009.
  • Pierre Ganty, Nicolas Maquet, and Jean-François Raskin. Fixpoint Guided Abstraction for Alternating Automata. In CIAA'09, LNCS5642, Springer, pp.155-164, 2009.
  • Laurent Doyen and Jean-François Raskin. Improved Algorithms for the Automata-Based Approach to Model-Checking. In Journal of Logical Methods in Computer Science-5(1:5)2009.
  • Franck Cassez, Jan J. Jessen, Kim Larsen, Jean-François Raskin, and Pierre-Alain Reynier. Automatic Synthesis of Robust and Optimal Controllers - An Industrial Case Study. In HSCC'09, LNCS 5469, Springer, pp. 90-104, 2009.
  • P. Haensch, M. Slaats, and W. Thomas. Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies. In FCT 2009, volume 5699 of LNCS, pages 181-192. Springer, 2009. A preliminary version is accepted at the conference AutoMathA 2009, Automata: from Mathematics to Applications, Lie, Belgium.
  • Dominik Klein, Frank G. Radmacher, and Wolfgang Thomas. The complexity of reachability in randomized sabotage games. In Proceedings of the 3rd International Conference on Fundamentals of Software Engineering, FSEN 2009, volume 5961 of Lecture Notes in Computer Science, pages 162-177. Springer.
  • W. Thomas. Facets of synthesis: Revisiting Church's problem. In Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2009, volume 5504 of Lecture Notes in Computer Science, pages 1-14. Springer, 2009.
  • F. Horn, W. Thomas, and N. Wallmeier. Optimal strategy synthesis for request-response games. In Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis, ATVA 2008, volume 5311 of Lecture Notes in Computer Science, pages 361-373. Springer, 2008.
  • M. Zimmermann. Time-optimal Winning Strategies for Poset Games. In Proceedings of the 14th International Conference on Implementation and Application of Automata, CIAA 2009, volume 5642 of Lecture Notes in Computer Science, pages 207-226.
  • Florian Horn. Random Fruits on the Zielonka Tree. In Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, STACS'09, volume 3 of Leibniz International Proceedings in Informatics, pages 541-552. Dagstuhl Research Online Publication Server, 2009.
  • Hugo Gimbert and Florian Horn. Solving Simple Stochastic Tail Games. In Proceedings of the 21st Symposium on Discrete Algorithms, SODA'10, pages 847-863. Society for Industrial and Applied Mathematics, 2010.
  • E. Grädel, Ł. Kaiser, and R. Rabinovich. Directed Graphs of Entanglement Two. In Proceedings of the 17th International Symposium on Fundamentals of Computation Theory, FCT '09, vol. 5699 of LNCS, pp. 169–181. Springer, 2009.
  • Serre, O. Qualitative Concurrent Stochastic Games with Imperfect Information. In Proceedings of Automata, Languages and Programming, 36th International Colloquium, ICALP 2009 5556, Springer, Lecture Notes in Computer Science, pp.200-211, 2009.
  • Kalyon, G., Le Gall, T., Marchand, H. and Massart, T. Computational Complexity for State-Feedback Controllers with Partial Observation. In Proceedings of 7th International Conference on Control and Automation, ICCA'09. pp 436-441.
  • Kalyon, G. and Le Gall, T. and Marchand, H. and Massart, T. Contrôle décentralisé de systèmes symboliques infinis sous observation partielle . In Journal Européen des Systèmes Automatisés (7ème Colloque Francophone sur la Modélisation des Systèmes Réactifs). Volume 43/7-9. pp 805-819.
  • Kalyon, G. and Gall T, Le and Marchand, H. and Massart, T. Control of Infinite Symbolic Transition Systems under Partial Observation. In Proceedings of European Control Conference. pp 1456-1462.
  • Doyen, L. and Geeraerts, G. and Raskin, J.-F. and Reichert, J. Realizability of Real-Time Logics. In Proceedings of FORMATS: Formal Modelling and Analysis of Timed Systems. LNCS 5813, pp 133-148. 2009. PDF
  • Chatterjee, K. and Doyen, L. and Henzinger, T.~A.Alternating Weighted Automata In Proceedings of FCT 2009: Fundamentals of Computation Theory. LNCS 5699, pp 3-13. 2009. PDF
  • Chatterjee, K. and Doyen, L. and Henzinger, T.~A. Probabilistic Weighted Automata. In Proceedings of CONCUR 2009: Concurrency Theory. LNCS 5710. pp 244-258. 2009. PDF
  • Chatterjee, K. and Doyen, L. and Henzinger, T.~A. Expressiveness and Closure Properties for Quantitative Languages. In Proceedings of LICS 2009: Logic in Computer Science. pp 199-208. 2009. PDF
  • Chatterjee, K. and Doyen, L. and Henzinger, T.~A. A Survey of Stochastic Games with Limsup and Liminf Objectives. In Proceedings of ICALP 2009: International Colloquium on Automata, Languages and Programming (Part II). LNCS 5556, pp 1-15. 2009. PDF
  • Patricia Bouyer, Marie Duflot, Nicolas Markey et Gabriel Renault. Measuring Permissivity in Finite Games. In Proceedings of the 20th International Conference on Concurrency Theory (CONCUR'09). LNCS 5710. pp 196-210. PDF
  • P. Gastin, N. Sznajder and M. Zeitoun. Distributed synthesis for well-connected architectures. Formal Methods in System Design 34(3). pp 215-237. PDF
  • Th. Chatain, P. Gastin and N. Sznajder. Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems. In Proceedings of the 35th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'09). LNCS 5404. pp 141-152.PDF
  • P. Bouyer and V. Forejt. Reachability in Stochastic Timed Games. In Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP'09). LNCS 5556. pp 103-114. PDF
  • R. Brenguier. Calcul des équilibres de Nash dans les jeux temporisés. Master Thesis. PDF
  • Brihaye T., Da Costa A., Laroussinie F., Markey N. ATL with Strategy Contexts and Bounded Memory. LFCS'09. LNCS 5407. pp 92-106. PDF
  • S. Demri (ENS Cachan), M. Jurdzinski, O. Lachish and R. Lazic (Warwick). The covering and boundedness problems for branching vector addition systems. 29th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS). PDF.
  • M. Jurdzinski, R. Lazic and M. Rutkowski (Warwick). Average-Price-per-Reward Games on Hybrid Automata with Strong Resets. 10th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI). LNCS 5403. pp 167-181. PDF
  • Martin Zimmermann. Time-optimal Winning Strategies for Poset Games. In Proceedings of the 14th International Conference on Implementation and Application of Automata (CIAA 2009). LNCS 5642. pp 217-226. PDF, technical report(with full proofs).
  • Peter Bulychev, Thomas Chatain, Alexandre David, Kim G. Larsen. Efficient on-the-fly Algorithm for Checking Alternating Timed Simulation . Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems. LNCS 5813. PDF.
  • Thomas Chatain, Alexandre David, Kim G. Larsen. Playing Games with Timed Games . Preprints of the 3rd IFAC Conference on Analysis and Design of Hybrid Systems. pp 238-243. PDF.
  • Emmanuel Filiot (ULB), Naiyong Jin (ULB), Jean-FranÇois Raskin (ULB). An Antichain Algorithm for LTL Realizability. In Proceedings of CAV'09, LNCS 5643. PDF.