List of publications

Refereed Articles and Book Chapters
[1] Jonas F. Jensen, Kim G. Larsen, Jiří Srba, Lars K. Østergaard. Efficient Model-Checking of Weighted CTL with Upper-Bound Constraints. In International Journal on Software Tools for Technology Transfer. Springer, 2016. (To appear) [bibtex] [pdf] [doi]
[2] Patricia Bouyer, Nicolas Markey, Steen Vester. Nash Equilibria in Symmetric Graph Games with Partial Observation. In Information & Computation. 2016. (To appear) [bibtex] [pdf]
[3] Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege. Pseudopolynomial Iterative Algorithm to Solve Total-Payoff Games and Min-Cost Reachability Games. In Acta Informatica. Springer, 2016. (To appear) [bibtex] [pdf]
[4] Patricia Bouyer, Patrick Gardy, Nicolas Markey. On the semantics of Strategy Logic. In Information Processing Letters 116(2):75-79. Elsevier Science Publishers, February 2016. [bibtex] [pdf] [doi]
[5] Florian Horn, Wolfgang Thomas, Nico Wallmeier, Martin Zimmermann. Optimal Strategy Synthesis for Request-Response Games. In RAIRO -- Theoretical Informatics and Applications 49(3):179-203. 2015. [bibtex] [pdf]
[6] Gilles Geeraerts, Alexander Heußner, M. Praveen, Jean-François Raskin. ω-Petri nets: algorithms and complexity. In Fundamenta Informaticae 137(1):29-60. IOS Press, 2015. [bibtex] [pdf] [doi]
[7] François Laroussinie, Nicolas Markey. Augmenting ATL with strategy contexts. In Information and Computation 245:98-123. Elsevier, December 2015. [bibtex] [pdf] [doi]
[8] Thomas Brihaye, Axel Haddad, Quentin Menet. Simple strategies for Banach-Mazur games and sets of probability 1. In Information and Computation 245:17-35. Elsevier, December 2015. [bibtex] [pdf] [doi]
[9] Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert, Thomas A. Henzinger. Randomness for free. In Information and Computation 245:3-16. Elsevier Science Publishers, December 2015. [bibtex] [pdf] [doi]
[10] Alexandre David, Kim G. Larsen, Axel Legay, Marius Mikučionis, Danny B. Poulsen. Uppaal SMC tutorial. In International Journal of Software Tools and Technology Transfer 17(4):397-415. Springer, August 2015. [bibtex] [pdf] [doi]
[11] José Antonio Mateo, Jiří Srba, Mathias G. Sørensen. Soundness of Timed-Arc Workflow Nets in Discrete and Continuous-Time Semantics. In Fundamenta Informaticae 140(1):89-121. IOS Press, July 2015. [bibtex] [pdf] [doi]
[12] Patricia Bouyer, Romain Brenguier, Nicolas Markey, Michael Ummels. Pure Nash Equilibria in Concurrent Games. In Logical Methods in Computer Science 11(2:9). June 2015. [bibtex] [pdf] [doi]
[13] Benedikt Brütsch. Synthesizing structured reactive programs via deterministic tree automata. In Information and Computation 242:108-127. Elsevier, June 2015. [bibtex] [pdf] [doi]
[14] Krishnendu Chatterjee, Laurent Doyen, Mickael Randour, Jean-François Raskin. Looking at Mean-Payoff and Total-Payoff through Windows. In Information and Computation 242:25-52. Elsevier, June 2015. [bibtex] [pdf] [doi]
[15] Gilles Geeraerts, Alexander Heußner, Jean-François Raskin. On the Verification of Concurrent, Asynchronous Programs with Waiting Queues. In ACM Transactions on Embedded Computing Systems 14(3):58. ACM Press, May 2015. [bibtex] [pdf] [doi]
[16] Nikola Beneš, Jan Kretínský, Kim G. Larsen, Mikael H. Møller, Salomon Sickert, Jiří Srba. Refinement checking on parametric modal transition systems. In Acta Informatica 52(2-3):269-297. Springer, April 2015. [bibtex] [pdf] [doi]
[17] Yaron Velner, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Alexander Moshe Rabinovich, Jean-François Raskin. The complexity of multi-mean-payoff and multi-energy games. In Information and Computation 241:177-196. Elsevier Science Publishers, April 2015. [bibtex] [pdf] [doi]
[18] Patricia Bouyer, Nicolas Markey, Ocan Sankur. Robust Reachability in Timed Automata and Games: A Game-based Approach. In Theoretical Computer Science 563:43-74. Elsevier, January 2015. [bibtex] [pdf] [doi]
[19] François Laroussinie, Nicolas Markey. Quantified CTL: Expressiveness and Complexity. In Logical Methods in Computer Science 10(4:17). December 2014. [bibtex] [pdf] [doi]
[20] Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Quentin Menet, Christel Baier, Marcus Größer, Marcin Jurdziński. Stochastic Timed Automata. In Logical Methods in Computer Science 10(4:6). December 2014. [bibtex] [pdf] [doi]
[21] Gilles Geeraerts, Jean-François Raskin, Nathalie Sznajder. On regions and zones for event-clock automata. In Formal Methods in System Design 45(3):330-380. Springer, December 2014. [bibtex] [pdf] [doi]
[22] Krishnendu Chatterjee, Mickael Randour, Jean-François Raskin. Strategy Synthesis for Multi-Dimensional Quantitative Objectives. In Acta Informatica 51(3-4):129-163. Springer, June 2014. [bibtex] [pdf] [doi]
[23] Peter Bulychev, Alexandre David, Kim G. Larsen, Guangyuan Li. Efficient Controller Synthesis for a fragment of MTL0,∞. In Acta Informatica 51(3-4):165-192. Springer, June 2014. [bibtex] [pdf] [doi]
[24] Patricia Bouyer, Kim G. Larsen, Nicolas Markey. Lower-Bound Constrained Runs in Weighted Timed Automata. In Performance Evaluation 73:91-109. Elsevier, March 2014. [bibtex] [pdf] [doi]
[25] Ocan Sankur, Patricia Bouyer, Nicolas Markey. Shrinking Timed Automata. In Information and Computation 234:107-132. Elsevier, February 2014. [bibtex] [pdf] [doi]
[26] Thomas Brihaye, Véronique Bruyère, Julie De Pril. On Equilibria in Quantitative Games with Reachability/Safety Objectives. In Theory of Computing Systems 54(2):150-189. Springer, February 2014. [bibtex] [pdf] [doi]
[27] Kim G. Larsen, Axel Legay, Louis-Marie Traonouez, Andrzej Wąsowski. Robust synthesis for real-time systems. In Theoretical Computer Science 515:96-122. Elsevier, January 2014. [bibtex] [pdf] [doi]
[28] Line Juhl, Kim G. Larsen, Jean-François Raskin. Optimal Bounds for Multiweighted and Parametrised Energy Games. In Theories of Programming and Formal Methods -- Essays Dedicated to Jifeng He on the Occasion of His 70th Birthday, pages 244-255. Volume 8051 of Lecture Notes in Computer Science. Springer, 2013. [bibtex] [pdf] [doi]
Refereed Conference Papers
[29] Patricia Bouyer, Maximilien Colange, Nicolas Markey. Symbolic Optimal Reachability in Weighted Timed Automata. In Proceedings of the 28th International Conference on Computer Aided Verification (CAV'16). Lecture Notes in Computer Science. Springer, 2016. (To appear) [bibtex] [pdf]
[30] Patricia Bouyer, Nicolas Markey, Mickael Randour, Arnaud Sangnier, Daniel Stan. Reachability in Networks of Register Protocols under Stochastic Schedulers. In Proceedings of the 43rd International Colloquium on Automata, Languages and Programming (ICALP'16). Leibniz International Proceedings in Informatics. Leibniz-Zentrum für Informatik, July 2016. (To appear) [bibtex] [pdf]
[31] Krishnendu Chatterjee, Laurent Doyen. Perfect-information Stochastic Games with Generalized Mean-Payoff Objectives. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'16). ACM Press, July 2016. (To appear) [bibtex] [pdf]
[32] Emmanuel Filiot, Ismaël Jecker, Christof Löding, Sarah Winter. On Equivalence and Uniformisation Problems for Finite Transducers. In Proceedings of the 43rd International Colloquium on Automata, Languages and Programming (ICALP'16). Leibniz International Proceedings in Informatics. Leibniz-Zentrum für Informatik, July 2016. (To appear) [bibtex] [pdf]
[33] Adrien Le Coënt, Julien Alexandre dit Sandretto, Alexandre Chapoutot, Laurent Fribourg. Control of Nonlinear Switched Systems Based on Validated Simulation. In Proceedings of the 2nd International Workshop on Symbolic and Numerical Methods for Reachability Analysis (SNR'16). IEEE Computer Society Press, July 2016. (To appear) [bibtex] [pdf]
[34] Krishnendu Chatterjee, Laurent Doyen. Computation Tree Logic for Synchronization Properties. In Proceedings of the 43rd International Colloquium on Automata, Languages and Programming (ICALP'16). Leibniz International Proceedings in Informatics. Leibniz-Zentrum für Informatik, July 2016. (To appear) [bibtex] [pdf]
[35] Arnaud Carayol, Christof Löding, Olivier Serre. Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'16). ACM Press, July 2016. (To appear) [bibtex]
[36] Patricia Bouyer, Thomas Brihaye, Pierre Carlier, Quentin Menet. Composition of stochastic timed automata. In Proceedings of the 11th ACM International Computer Science Symposium in Russia (CSR'16). Springer, June 2016. (To appear) [bibtex] [pdf]
[37] Jonas F. Jensen, Kim G. Larsen, Jiří Srba. Real-Time Strategy Synthesis for Timed-Arc Petri Net Games via Discretization. In Proceedings of the 23rd International Symposium on Model-Cherking Software (SPIN'16), pages 129-146. Volume 9641 of Lecture Notes in Computer Science. Springer, April 2016. [bibtex] [pdf] [doi]
[38] Christof Löding, P. Madhusudan, Daniel Neider. Abstract Learning Frameworks for Synthesis. In Proceedings of the 22nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'16), pages 167-185. Volume 9636 of Lecture Notes in Computer Science. Springer, April 2016. [bibtex] [pdf] [doi]
[39] Kim G. Larsen, Marius Mikučionis, Marco Muñiz, Jiří Srba, Jakob H. Taankvist. Online and Compositional Learning of Controllers with Application to Floor Heating. In Proceedings of the 22nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'16), pages 244-259. Volume 9636 of Lecture Notes in Computer Science. Springer, April 2016. [bibtex] [pdf] [doi]
[40] Laurent Fribourg, Éric Goubault, Sameh Mohamed, Sylvie Putot. A Topological Method for Finding Invariant Sets of Switched Systems. In Proceedings of the 19th ACM International Conference on Hybrid Systems: Computation and Control (HSCC'16), pages 61-70. ACM Press, April 2016. [bibtex] [pdf] [doi]
[41] Romain Brenguier, Lorenzo Clemente, Paul Hunter, Guillermo A. Pérez, Mickael Randour, Jean-François Raskin, Ocan Sankur, Mathieu Sassolas. Non-Zero Sum Games for Reactive Synthesis. In Proceedings of the 10th International Conference on Language and Automata Theory and Applications (LATA'16), pages 3-23. Volume 9618 of Lecture Notes in Computer Science. Springer, March 2016. [bibtex] [pdf] [doi]
[42] Mickael Randour, Jean-François Raskin, Ocan Sankur. Percentile Queries in Multi-dimensional Markov Decision Processes. In Proceedings of the 27th International Conference on Computer Aided Verification (CAV'15), pages 123-139. Volume 9206 of Lecture Notes in Computer Science. Springer, 2015. [bibtex] [pdf] [doi]
[43] Jesper R. Andersen, Niklas Andersen, Søren Enevoldsen, Mathias M. Hansen, Kim G. Larsen, Simon R. Olesen, Jiří Srba, Jacob K. Wortmann. CAAL: Concurrency Workbench, Aalborg Edition. In Proceedings of the 12th International Colloquium on Theoretical Aspects of Computing (ICTAC'15), pages 573-582. Volume 9399 of Lecture notes in Computer Science. Springer, 2015. [bibtex] [pdf] [doi]
[44] Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, Benjamin Monmege. Simple Priced Timed Games Are Not That Simple. In Proceedings of the 35th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'15), pages 278-292. Volume 45 of Leibniz International Proceedings in Informatics. Leibniz-Zentrum für Informatik, December 2015. [bibtex] [pdf] [doi]
[45] Patricia Bouyer, Patrick Gardy, Nicolas Markey. Weighted strategy logic with Boolean goals over one-counter games. In Proceedings of the 35th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'15), pages 69-83. Volume 45 of Leibniz International Proceedings in Informatics. Leibniz-Zentrum für Informatik, December 2015. [bibtex] [pdf] [doi]
[46] Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege, Guillermo Perez, Gabriel Renault. Quantitative Games under Failures. In Proceedings of the 35th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'15), pages 293-306. Volume 45 of Leibniz International Proceedings in Informatics. Leibniz-Zentrum für Informatik, December 2015. [bibtex] [pdf] [doi]
[47] Dietmar Berwanger, Marie Van den Bogaard. Games with Delays. A Frankenstein Approach. In Proceedings of the 35th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'15), pages 307-319. Volume 45 of Leibniz International Proceedings in Informatics. Leibniz-Zentrum für Informatik, December 2015. [bibtex] [pdf] [doi]
[48] Dietmar Berwanger, Anup Basil Mathew, Marie Van den Bogaard. Hierarchical Information Patterns and Distributed Strategy Synthesis. In Proceedings of the 13th International Symposium on Automated Technology for Verification and Analysis (ATVA'15), pages 378-393. Volume 9364 of Lecture Notes in Computer Science. Springer, October 2015. [bibtex] [pdf] [doi]
[49] Kim G. Larsen, Marius Mikučionis, Jakob H. Taankvist. Safe and Optimal Adaptive Cruise Control. Chapter in Correct System Design -- Symposium in Honor of Ernst-Rüdiger Olderog on the Occasion of His 60th Birthday. Volume 9360 of Lecture Notes in Computer Science. Springer, September 2015. [bibtex] [pdf] [doi]
[50] Thomas Brihaye, Véronique Bruyère, Noémie Meunier, Jean-François Raskin. Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability. In Proceedings of the 24th EACSL Annual Conference on Computer Science Logic (CSL'15), pages 504-518. Volume 41 of Leibniz International Proceedings in Informatics. Leibniz-Zentrum für Informatik, September 2015. [bibtex] [pdf] [doi]
[51] Patricia Bouyer, Nicolas Markey, Nicolas Perrin, Philipp Schlehuber. Timed automata abstraction of switched dynamical systems using control funnels. In Proceedings of the 13th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'15), pages 60-75. Volume 9268 of Lecture Notes in Computer Science. Springer, September 2015. [bibtex] [pdf] [doi]
[52] Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Benjamin Monmege. To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games. In Proceedings of the 26th International Conference on Concurrency Theory (CONCUR'15), pages 297-310. Volume 42 of Leibniz International Proceedings in Informatics. Leibniz-Zentrum für Informatik, September 2015. [bibtex] [pdf] [doi]
[53] Étienne André, Nicolas Markey. Language Preservation Problems in Parametric Timed Automata. In Proceedings of the 13th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'15), pages 27-43. Volume 9268 of Lecture Notes in Computer Science. Springer, September 2015. [bibtex] [pdf] [doi]
[54] Patricia Bouyer, Samy Jaziri, Nicolas Markey. On the Value Problem in Weighted Timed Games. In Proceedings of the 26th International Conference on Concurrency Theory (CONCUR'15), pages 311-324. Volume 42 of Leibniz International Proceedings in Informatics. Leibniz-Zentrum für Informatik, September 2015. [bibtex] [pdf] [doi]
[55] Patricia Bouyer, Nicolas Markey, Mickael Randour, Kim G. Larsen, Simon Laursen. Average-energy games. In Proceedings of the 6th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF'15), pages 1-15. Volume 193 of Electronic Proceedings in Theoretical Computer Science. September 2015. [bibtex] [pdf] [doi]
[56] Jan Kretínský, Kim G. Larsen, Simon Laursen, Jiří Srba. Polynomial Time Decidability of Weighted Synchronization under Partial Observability. In Proceedings of the 26th International Conference on Concurrency Theory (CONCUR'15), pages 142-154. Volume 42 of Leibniz International Proceedings in Informatics. Leibniz-Zentrum für Informatik, September 2015. [bibtex] [pdf] [doi]
[57] Dietmar Berwanger, Marie Van den Bogaard. Consensus Game Acceptors. In Proceedings of the 19th International Conference on Developments in Language Theory (DLT'15), pages 108-119. Volume 9168 of Lecture Notes in Computer Science. Springer, July 2015. [bibtex] [pdf] [doi]
[58] Krishnendu Chatterjee, Laurent Doyen, Moshe Vardi. The Complexity of Synthesis from Probabilistic Components. In Proceedings of the 42nd International Colloquium on Automata, Languages and Programming (ICALP'15) -- Part II, pages 108-120. Volume 9135 of Lecture Notes in Computer Science. Springer, July 2015. [bibtex] [pdf] [doi]
[59] Nikola Beneš, Peter Bezděk, Kim Gulstrand Larsen, Jiří Srba. Language Emptiness of Continuous-Time Parametric Timed Automata. In Proceedings of the 42nd International Colloquium on Automata, Languages and Programming (ICALP'15) -- Part II, pages 69-81. Volume 9135 of Lecture Notes in Computer Science. Springer, July 2015. [bibtex] [pdf] [doi]
[60] Giorgio Bacci, Giovani Bacci, Kim G. Larsen, Radu Mardare. On the total variation distance of semi-Markov chains. In Proceedings of the 18th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'15), pages 185-199. Volume 9034 of Lecture Notes in Computer Science. Springer, April 2015. [bibtex] [pdf] [doi]
[61] Alexandre David, Peter G. Jensen, Kim G. Larsen, Marius Mikučionis, Jakob H. Taankvist. Uppaal Stratego. In Proceedings of the 21st International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'15), pages 206-211. Volume 9035 of Lecture Notes in Computer Science. Springer, April 2015. [bibtex] [pdf] [doi]
[62] Daniel Gebler, Kim G. Larsen, Simone Tini. Compositional metric reasoning with probabilistic process calculi. In Proceedings of the 18th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'15), pages 230-245. Volume 9034 of Lecture Notes in Computer Science. Springer, April 2015. [bibtex] [pdf] [doi]
[63] Mickael Randour, Jean-François Raskin, Ocan Sankur. Variations on the Stochastic Shortest Path Problem. In Proceedings of the 16th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI'15), pages 1-18. Volume 8931 of Lecture Notes in Computer Science. Springer, January 2015. [bibtex] [pdf] [doi]
[64] Laurent Doyen, Line Juhl, Kim G. Larsen, Nicolas Markey, Mahsa Shirmohammadi. Synchronizing words for weighted and timed automata. In Proceedings of the 34th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'14), pages 121-132. Volume 29 of Leibniz International Proceedings in Informatics. Leibniz-Zentrum für Informatik, December 2014. [bibtex] [pdf] [doi]
[65] Patricia Bouyer, Nicolas Markey, Daniel Stan. Mixed Nash Equilibria in Concurrent Games. In Proceedings of the 34th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'14), pages 351-363. Volume 29 of Leibniz International Proceedings in Informatics. Leibniz-Zentrum für Informatik, December 2014. [bibtex] [pdf] [doi]
[66] Patricia Bouyer, Patrick Gardy, Nicolas Markey. Quantitative verification of weighted Kripke structures. In Proceedings of the 12th International Symposium on Automated Technology for Verification and Analysis (ATVA'14), pages 64-80. Volume 8837 of Lecture Notes in Computer Science. Springer, November 2014. [bibtex] [pdf] [doi]
[67] Nicolas Markey, Steen Vester. Symmetry Reduction in Infinite Games with Finite Branching. In Proceedings of the 12th International Symposium on Automated Technology for Verification and Analysis (ATVA'14), pages 281-296. Volume 8837 of Lecture Notes in Computer Science. Springer, November 2014. [bibtex] [pdf] [doi]
[68] Alexandre David, Peter G. Jensen, Kim G. Larsen, Axel Legay, Didier Lime, Mathias G. Sørensen, Jakob H. Taankvist. On Time with Minimal Expected Cost!. In Proceedings of the 12th International Symposium on Automated Technology for Verification and Analysis (ATVA'14), pages 129-145. Volume 8837 of Lecture Notes in Computer Science. Springer, November 2014. [bibtex] [pdf] [doi]
[69] Simon Tenbusch, Christof Löding, Frank Radmacher, James Gross. Guaranteeing Stability and Delay in Dynamic Networks based on Infinite Games. In Proceedings of the 11th IEEE International Conference on Mobile Ad hoc and Sensor Systems (MASS'14). IEEE Comp. Soc. Press, October 2014. [bibtex] [pdf] [doi]
[70] Giorgio Bacci, Giovani Bacci, Kim G. Larsen, Radu Mardare. The Behavior of Probabilistic Systems: From Equivalences to Behavioral Distances. In Essays for the Luca Cardelli Fest, pages 15-26. Microsoft Research, September 2014. [bibtex] [pdf]
[71] Gilles Geeraerts, Joël Goossens, Amélie Stainer. Synthesising Succinct Strategies in Safety Games. In Proceedings of the 8th Workshop on Reachability Problems in Computational Models (RP'14), pages 98-111. Volume 8762 of Lecture Notes in Computer Science. Springer, September 2014. [bibtex] [pdf] [doi]
[72] Kim G. Larsen, Simon Laursen, Jiří Srba. Synchronizing Strategies under Partial Observability. In Proceedings of the 25th International Conference on Concurrency Theory (CONCUR'14), pages 188-202. Volume 8704 of Lecture Notes in Computer Science. Springer, September 2014. [bibtex] [pdf] [doi]
[73] Alexandre David, Huixing Fang, Kim G. Larsen, Zhengkui Zhang. Verification and Performance Evaluation of Timed Game Strategies. In Proceedings of the 12th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'14), pages 100-114. Volume 8711 of Lecture Notes in Computer Science. Springer, September 2014. [bibtex] [pdf] [doi]
[74] Laurent Doyen, Thierry Massart, Mahsa Shirmohammadi. Robust Synchronization in Markov Decision Processes. In Proceedings of the 25th International Conference on Concurrency Theory (CONCUR'14), pages 234-248. Volume 8704 of Lecture Notes in Computer Science. Springer, September 2014. [bibtex] [pdf] [doi]
[75] Serge Haddad, Benjamin Monmege. Reachability in MDPs: Refining Convergence of Value Iteration. In Proceedings of the 8th Workshop on Reachability Problems in Computational Models (RP'14), pages 125-137. Volume 8762 of Lecture Notes in Computer Science. Springer, September 2014. [bibtex] [pdf] [doi]
[76] Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts. On MITL and alternating timed automata over infinite words. In Proceedings of the 12th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'14), pages 69-84. Volume 8711 of Lecture Notes in Computer Science. Springer, September 2014. [bibtex] [pdf] [doi]
[77] Sine Viesmose Birch, Thomas Stig Jacobsen, Jacob Jon Jensen, Christoffer Moesgaard, Niels Nørgaard Samuelsen, Jiří Srba. Interval Abstraction Refinement for Model Checking of Timed-Arc Petri Nets. In Proceedings of the 12th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'14), pages 237-251. Volume 8711 of Lecture Notes in Computer Science. Springer, September 2014. [bibtex] [pdf] [doi]
[78] Thomas Brihaye, Gilles Geeraerts, Shankara Narayanan Krishna, Lakshmi Manasa, Benjamin Monmege, Ashutosh Trivedi. Adding Negative Prices to Priced Timed Games. In Proceedings of the 25th International Conference on Concurrency Theory (CONCUR'14), pages 560-575. Volume 8704 of Lecture Notes in Computer Science. Springer, September 2014. [bibtex] [pdf] [doi]
[79] Nathalie Bertrand, Thomas Brihaye, Blaise Genest. Deciding the value 1 problem for reachability in one-clock decision stochastic timed automata. In Proceedings of the 11th International Cconference on Quantitative Evaluation of Systems (QEST'14), pages 313-328. IEEE Comp. Soc. Press, September 2014. [bibtex] [pdf] [doi]
[80] Patricia Bouyer, Nicolas Markey, Raj Mohan Matteplackel. Averaging in LTL. In Proceedings of the 25th International Conference on Concurrency Theory (CONCUR'14), pages 266-280. Volume 8704 of Lecture Notes in Computer Science. Springer, September 2014. [bibtex] [pdf] [doi]
[81] Youssouf Oualhadj, Pierre-Alain Reynier, Ocan Sankur. Probabilistic Robust Timed Games. In Proceedings of the 25th International Conference on Concurrency Theory (CONCUR'14), pages 203-217. Volume 8704 of Lecture Notes in Computer Science. Springer, September 2014. [bibtex] [pdf] [doi]
[82] Christof Löding, Sarah Winter. Synthesis of Deterministic Top-down Tree Transducers from Automatic Tree Relations. In Proceedings of the 5th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF'14), pages 88-101. Volume 161 of Electronic Proceedings in Theoretical Computer Science. August 2014. [bibtex] [pdf] [doi]
[83] Namit Chaturvedi, Marcus Gelderie. Classifying Recognizable Infinitary Trace Languages Using Word Automata. In Proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS'14) -- Part I, pages 171-182. Volume 8634 of Lecture Notes in Computer Science. Springer, August 2014. [bibtex] [pdf] [doi]
[84] Julie De Pril, János Flesch, Jeroen Kuipers, Gijs Schoenmakers, Koos Vrieze. Existence of Secure Equilibrium in Multi-Player Games with Perfect Information. In Proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS'14) -- Part II, pages 213-225. Volume 8635 of Lecture Notes in Computer Science. Springer, August 2014. [bibtex] [pdf] [doi]
[85] Aaron Bohy, Véronique Bruyère, Jean-François Raskin. Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes. In Proceedings of the 3rd Workshop on Synthesis (SYNT'14), pages 51-67. Volume 157 of Electronic Proceedings in Theoretical Computer Science. July 2014. [bibtex] [pdf] [doi]
[86] Namit Chaturvedi. Toward a structure theory of regular infinitary trace languages. In Proceedings of the 41st International Colloquium on Automata, Languages and Programming (ICALP'14) -- Part II, pages 134-145. Volume 8573 of Lecture Notes in Computer Science. Springer, July 2014. [bibtex] [pdf] [doi]
[87] Véronique Bruyère, Noëmie Meunier, Jean-François Raskin. Secure Equilibria in Weighted Games. In Proceedings of the Joint Meeting of the 23rd EACSL Annual Conference on Computer Science Logic and the 29th Annual ACM/IEEE Symposium on Logic In Computer Science (CSL/LICS'14). ACM Press, July 2014. [bibtex] [pdf] [doi]
[88] Krishnendu Chatterjee, Laurent Doyen. Games with a Weak Adversary. In Proceedings of the 41st International Colloquium on Automata, Languages and Programming (ICALP'14) -- Part II, pages 110-121. Volume 8573 of Lecture Notes in Computer Science. Springer, July 2014. [bibtex] [pdf] [doi]
[89] José Antonio Mateo, Jiří Srba, Mathias G. Sørensen. Soundness of Timed-Arc Workflow Nets. In Proceedings of the 35th International Conference on Applications and Theory of Petri Nets (ICATPN'14). Volume 8489 of Lecture Notes in Computer Science. Springer, June 2014. [bibtex] [pdf] [doi]
[90] Alexandre David, Kim G. Larsen, Axel Legay, Guangyuan Li, Danny B. Poulsen. Quantified Dynamic Metric Temporal Logic for Dynamic Networks of Stochastic Hybrid Automata. In Proceedings of the 14th International Conference on Application of Concurrency to System Design (ACSD'14), pages 32-41. IEEE Comp. Soc. Press, June 2014. [bibtex] [pdf] [doi]
[91] Krishnendu Chatterjee, Laurent Doyen, Sumit Nain, Moshe Y. Vardi. The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies. In Proceedings of the 17th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'14), pages 242-257. Volume 8412 of Lecture Notes in Computer Science. Springer, April 2014. [bibtex] [pdf] [doi]
[92] Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert, Youssouf Oualhadj. Perfect-Information Stochastic Mean-Payoff Parity Games. In Proceedings of the 17th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'14), pages 210-225. Volume 8412 of Lecture Notes in Computer Science. Springer, April 2014. [bibtex] [pdf] [doi]
[93] Peter G. Jensen, Kim G. Larsen, Jiří Srba, Mathias G. Sørensen, Jakob H. Taankvist. Memory Efficient Data Structures for Explicit Verification of Timed Systems. In Proceedings of the 6th NASA Formal Methods Symposium (NFM'14), pages 307-312. Volume 8430 of Lecture Notes in Computer Science. Springer, April 2014. [bibtex] [pdf] [doi]
[94] Laurent Doyen, Thierry Massart, Mahsa Shirmohammadi. Limit Synchronization in Markov Decision Processes. In Proceedings of the 17th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'14), pages 58-72. Volume 8412 of Lecture Notes in Computer Science. Springer, April 2014. [bibtex] [pdf] [doi]
[95] Véronique Bruyère, Emmanuel Filiot, Mickael Randour, Jean-François Raskin. Meet Your Expectations with Guarantees: Beyond Worst-Case Synthesis in Quantitative Games. In Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS'14), pages 199-213. Volume 25 of Leibniz International Proceedings in Informatics. Leibniz-Zentrum für Informatik, March 2014. [bibtex] [pdf] [doi]
[96] Krishnendu Chatterjee, Laurent Doyen, Emmanuel Filiot, Jean-François Raskin. Doomsday Equilibria for Omega-Regular Games. In Proceedings of the 15th International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI'14), pages 78-97. Volume 8318 of Lecture Notes in Computer Science. Springer, January 2014. [bibtex] [pdf] [doi]
[97] Krishnendu Chatterjee, Laurent Doyen, Mickael Randour, Jean-François Raskin. Looking at Mean-Payoff and Total-Payoff through Windows. In Proceedings of the 11th International Symposium on Automated Technology for Verification and Analysis (ATVA'13), pages 118-132. Volume 8172 of Lecture Notes in Computer Science. Springer, October 2013. [bibtex] [pdf] [doi]
[98] Peter H. Dalsgaard, Thibault Le Guilly, Daniel Middelhede, Petur Olsen, Thomas Pedersen, Anders P. Ravn, Arne Skou. A Toolchain for Home Automation Controller Development. In Proceedings of the 39th Euromicro Conference on Software Engineering and Advanced Applications (SEAA'13), pages 122-129. September 2013. [bibtex] [pdf] [doi]
[99] Patricia Bouyer, Nicolas Markey, Ocan Sankur. Robustness in timed automata. In Proceedings of the 7th Workshop on Reachability Problems in Computational Models (RP'13), pages 1-18. Volume 8169 of Lecture Notes in Computer Science. Springer, September 2013. (Invited paper) [bibtex] [pdf] [doi]
[100] François Laroussinie, Nicolas Markey. Satisfiability of ATL with strategy contexts. In Proceedings of the 4th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF'13), pages 208-223. Volume 119 of Electronic Proceedings in Theoretical Computer Science. August 2013. [bibtex] [pdf] [doi]
[101] Thomas Brihaye, Quentin Menet. Simple strategies for Banach-Mazur games and fairly correct systems. In Proceedings of the 4th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF'13), pages 21-34. Volume 119 of Electronic Proceedings in Theoretical Computer Science. August 2013. [bibtex] [pdf] [doi]
[102] Giorgio Bacci, Giovani Bacci, Kim G. Larsen, Radu Mardare. The BisimDist Library: Efficient Computation of Bisimilarity Distances for Markovian Models. In Proceedings of the 10th International Conference on Quantitative Evaluation of Systems (QEST'13), pages 278-281. IEEE Comp. Soc. Press, August 2013. [bibtex] [pdf] [doi]
[103] Patricia Bouyer, Nicolas Markey, Ocan Sankur. Robust Weighted Timed Automata and Games. In Proceedings of the 11th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'13), pages 31-36. Volume 8053 of Lecture Notes in Computer Science. Springer, August 2013. [bibtex] [pdf] [doi]
[104] Ocan Sankur, Patricia Bouyer, Nicolas Markey, Pierre-Alain Reynier. Robust Controller Synthesis in Timed Automata. In Proceedings of the 24th International Conference on Concurrency Theory (CONCUR'13), pages 546-560. Volume 8052 of Lecture Notes in Computer Science. Springer, August 2013. [bibtex] [pdf] [doi]
[105] Giorgio Bacci, Giovani Bacci, Kim G. Larsen, Radu Mardare. Computing Behavioral Distances, Compositionally. In Proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science (MFCS'13), pages 74-85. Volume 8087 of Lecture Notes in Computer Science. Springer, August 2013. [bibtex] [pdf] [doi]
[106] Marcus Gelderie. Strategy Composition in Compositional Games. In Proceedings of the 40th International Colloquium on Automata, Languages and Programming (ICALP'13) -- Part II, pages 263-274. Volume 7966 of Lecture Notes in Computer Science. Springer, July 2013. [bibtex] [pdf] [doi]
[107] Jonas F. Jensen, Kim G. Larsen, Jiří Srba, Lars K. Østergaard. Local Model Checking of Weighted CTL with Upper-Bound Constraints. In Proceedings of the 20th International Symposium on Model-Cherking Software (SPIN'13), pages 178-195. Volume 7976 of Lecture Notes in Computer Science. Springer, July 2013. [bibtex] [pdf] [doi]
[108] Alexandre David, Dehui Du, Kim G. Larsen, Axel Legay, Marius Mikučionis. Optimizing Control Strategy Using Statistical Model Checking. In Proceedings of the th NASA Formal Methods Symposium (NFM'13), pages 352-367. Volume 7871 of Lecture Notes in Computer Science. Springer, May 2013. [bibtex] [pdf] [doi]
Refereed Workshop Papers
[109] Kim G. Larsen, Simon Laursen, Martin Zimmermann. Limit Your Consumption! Finding Bounds in Average-energy Games. In Proceedings of the 14th International Workshop on Quantitative Aspects of Programming Languages and Systems (QAPL'16). Electronic Proceedings in Theoretical Computer Science. 2016. [bibtex] [pdf]
[110] Benedikt Brütsch, Wolfgang Thomas. Playing Games in the Baire Space. In Joint Proceedings of the Cassting Workshop on Games for the Synthesis of Complex Systems and of the 3rd International Workshop on Synthesis of Complex Parameters (Cassting'16/SynCoP'16). Electronic Proceedings in Theoretical Computer Science. 2016. (To appear) [bibtex] [pdf]
[111] Thomas Brihaye, Amit Kumar Dhar, Gilles Geeraerts, Axel Haddad, Benjamin Monmege. Efficient Energy Distribution in a Smart Grid using Multi-Player Games. In Joint Proceedings of the Cassting Workshop on Games for the Synthesis of Complex Systems and of the 3rd International Workshop on Synthesis of Complex Parameters (Cassting'16/SynCoP'16). Electronic Proceedings in Theoretical Computer Science. 2016. (To appear) [bibtex] [pdf]
[112] Patricia Bouyer, Erwin Fang, Nicolas Markey. Permissive strategies in timed automata and games. In Proceedings of the 15th International Workshop on Automated Verification of Critical Systems (AVoCS'15), pages 263-277. September 2015. [bibtex] [pdf]
[113] Laurent Fribourg, Ulrich Kühne, Nicolas Markey. Game-based Synthesis of Distributed Controllers for Sampled Switched Systems. In Proceedings of the 2nd International Workshop on Synthesis of Continuous Parameters (SYNCOP'15), pages 47-61. Volume 44 of Open Access Series in Informatics. Leibniz-Zentrum für Informatik, April 2015. [bibtex] [pdf] [doi]
[114] Patricia Bouyer, Nicolas Markey, Steen Vester. Nash Equilibria in Symmetric Games with Partial Observation. In Proceedings of the 2nd International Workshop on Strategic Reasoning (SR'14), pages 49-55. Volume 146 of Electronic Proceedings in Theoretical Computer Science. April 2014. [bibtex] [pdf] [doi]
[115] Véronique Bruyère, Emmanuel Filiot, Mickael Randour, Jean-François Raskin. Expectations or Guarantees? I Want It All! A crossroad between games and MDPs. In Proceedings of the 2nd International Workshop on Strategic Reasoning (SR'14), pages 1-8. Volume 146 of Electronic Proceedings in Theoretical Computer Science. April 2014. [bibtex] [pdf] [doi]
[116] Dietmar Berwanger, Anup Basil Mathew. Games with Recurring Certainty. In Proceedings of the 2nd International Workshop on Strategic Reasoning (SR'14), pages 91-96. Volume 146 of Electronic Proceedings in Theoretical Computer Science. April 2014. [bibtex] [pdf] [doi]
[117] Alexandre David, Kim G. Larsen, Axel Legay, Danny Bøgsted Poulsen. Statistical Model Checking of Dynamic Networks of Stochastic Hybrid Automata. In Proceedings of the 13th International Workshop on Automated Verification of Critical Systems (AVOCS'13). Volume 10 of Electronic Communications of the EASST. EASST, September 2013. [bibtex] [pdf]
Research reports
[118] Arnaud Carayol, Christof Löding, Olivier Serre. Pure Strategies in Imperfect Information Stochastic Games. Research report 1506.09140, arXiv, 2015. [bibtex] [pdf]
[119] Dietmar Berwanger, Anup Basil Mathew. Infinite games with finite knowledge gaps. Research report 1411.5820, arXiv, November 2014. [bibtex] [pdf]
[120] Erwin Fang. Permissive multi-strategies in timed games. Research report LSV-14-04, Laboratoire Spécification et Vérification, ENS Cachan, France, March 2014. (36 pages) [bibtex] [pdf]
[121] Namit Chaturvedi, Marcus Gelderie. Weak ω-Regular Trace Languages. Research report 1402.3199, arXiv, February 2014. [bibtex] [pdf]
Other Publications
[122] Thomas Brihaye, Benoît Delahaye, Loïg Jezequel, Nicolas Markey, Jiří Srba. Joint Proceedings of the Cassting Workshop on Games for the Synthesis of Complex Systems and of the 3rd International Workshop on Synthesis of Complex Parameters (Cassting'16/SynCoP'16). Electronic Proceedings in Theoretical Computer Science. 2016. (To appear) [bibtex]
[123] Krishnendu Chatterjee, Stéphane Lafortune, Nicolas Markey, Wolfgang Thomas. Non-Zero-Sum-Games and Control (Dagstuhl Seminar 15061). In Dagstuhl Reports 5(2):1-25. Leibniz-Zentrum für Informatik, June 2015. [bibtex] [pdf] [doi]
[124] Namit Chaturvedi. Classifications of Recognizable Infinitary Trace Languages and the Distributed Synthesis Problem. PhD thesis, Department of Computer Science, RWTH Aachen, Germany, December 2014. [bibtex] [pdf]
[125] Mathias G. Sørensen. Controller Synthesis for Home Automation. Master's thesis, Computer Science Department, Aalborg University, Denmark, June 2014. [bibtex] [pdf]
[126] Nicolas Markey. Cassting: Synthesizing Complex Systems Using Non-Zero-Sum Games. In ERCIM News 97:25-26. European Research Consortium for Informatics and Mathematics, April 2014. [bibtex] [pdf]
[127] Marcus Gelderie. Strategy Machines -- Representation and Complexity of Strategies in Infinite Games. PhD thesis, Department of Computer Science, RWTH Aachen, Germany, February 2014. [bibtex] [pdf]
[128] Daniel Ejsing-Dunn, Lisa Fontani. Infinite Runs in Recharge Automata. Master's thesis, Computer Science Department, Aalborg University, Denmark, June 2013. [bibtex] [pdf]