2015  

[BBM+15]  Patricia Bouyer, Romain Brenguier, Nicolas Markey, and Michael Ummels. Pure Nash Equilibria in Concurrent Games. Logical Methods in Computer Science 11(2:9). June 2015. 
[BMS15]  Patricia Bouyer, Nicolas Markey, and Ocan Sankur. Robust Reachability in Timed Automata and Games: A Gamebased Approach. Theoretical Computer Science 563:4374. Elsevier, January 2015. 
[LM15]  François Laroussinie and Nicolas Markey. Augmenting ATL with strategy contexts. Information and Computation 245:98123. Elsevier, December 2015. 
[AM15]  Étienne André and Nicolas Markey. Language Preservation Problems in Parametric Timed Automata. In FORMATS'15, Lecture Notes in Computer Science 9268, pages 2743. SpringerVerlag, September 2015. 
[BFM15]  Patricia Bouyer, Erwin Fang, and Nicolas Markey. Permissive strategies in timed automata and games. In AVOCS'15, Electronic Communications of the EASST 72. European Association of Software Science and Technology, September 2015. 
[BGM15]  Patricia Bouyer, Patrick Gardy, and Nicolas Markey. Weighted strategy logic with boolean goals over onecounter games. In FSTTCS'15, Leibniz International Proceedings in Informatics 45, pages 6983. LeibnizZentrum für Informatik, December 2015. 
[BJM15]  Patricia Bouyer, Samy Jaziri, and Nicolas Markey. On the Value Problem in Weighted Timed Games. In CONCUR'15, Leibniz International Proceedings in Informatics 42, pages 311324. LeibnizZentrum für Informatik, September 2015. 
[BMP+15]  Patricia Bouyer, Nicolas Markey, Nicolas Perrin, and Philipp SchlehuberCaissier. Timed automata abstraction of switched dynamical systems using control funnels. In FORMATS'15, Lecture Notes in Computer Science 9268, pages 6075. SpringerVerlag, September 2015. 
[BMR+15]  Patricia Bouyer, Nicolas Markey, Mickael Randour, Kim Guldstrand Larsen, and Simon Laursen. Averageenergy games. In GandALF'15, Electronic Proceedings in Theoretical Computer Science 193, pages 115. September 2015. 
[LMS15]  François Laroussinie, Nicolas Markey, and Arnaud Sangnier. ATLsc with partial observation. In GandALF'15, Electronic Proceedings in Theoretical Computer Science 193, pages 4357. September 2015. 
[CLM+15]  Krishnendu Chatterjee, Stéphane Lafortune, Nicolas Markey, and Wolfgang Thomas (eds.) NonZeroSumGames and Control (Dagstuhl Seminar 15061). Dagstuhl Reports 5(2):125. LeibnizZentrum für Informatik, June 2015. 
[AAG+15]  Manindra Agrawal, S. Akshay, Blaise Genest, and P. S. Thiagarajan. Approximate Verification of the Symbolic Dynamics of Markov Chains. Journal of the ACM 62(1):183235. ACM Press, February 2015. 
[ABG15]  C. Aiswarya, Benedikt Bollig, and Paul Gastin. An automatatheoretic approach to the verification of distributed algorithms. In CONCUR'15, Leibniz International Proceedings in Informatics 42, pages 340353. LeibnizZentrum für Informatik, September 2015. 
[AKK15]  Shaull Almagor, Denis Kuperberg, and Orna Kupferman. The Sensing Cost of Monitoring and Synthesis. In FSTTCS'15, Leibniz International Proceedings in Informatics 45, pages 380393. LeibnizZentrum für Informatik, December 2015. 
[ARZ15]  Benjamin Aminof, Sasha Rubin, and Florian Zuleger. On the Expressive Power of Communication Primitives in Parameterised Systems. In LPAR'15, Lecture Notes in Computer Science 9450, pages 313328. SpringerVerlag, November 2015. 
[BBL+15]  Nikola Beneš, Petr Bezdek, Kim Guldstrand Larsen, and Jiří Srba. Language Emptiness of ContinuousTime Parametric Timed Automata. In ICALP'15, Lecture Notes in Computer Science 9135, pages 6981. SpringerVerlag, July 2015. 
[BBM+15]  Thomas Brihaye, Véronique Bruyère, Noëmie Meunier, and JeanFrançois Raskin. Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability. In CSL'15, Leibniz International Proceedings in Informatics 41, pages 504518. LeibnizZentrum für Informatik, September 2015. 
[BEG+15]  Endre Boros, Khaled Elbassioni, Vladimir Gurvich, and Kazuhisa Makino. Markov Decision Processes and Stochastic Games with Total Effective Payoff. In STACS'15, Leibniz International Proceedings in Informatics 30, pages 103115. LeibnizZentrum für Informatik, March 2015. 
[BFA15]  Umang Bhaskar, Lisa Fleischer, and Elliot Anshelevich. A Stackelberg strategy for routing flow over time. Games and Economic Behavior 92:232247. July 2015. 
[BFS15]  Nathalie Bertrand, Paulin Fournier, and Arnaud Sangnier. Distributed Local Strategies in Broadcast Networks. In CONCUR'15, Leibniz International Proceedings in Informatics 42, pages 4457. LeibnizZentrum für Informatik, September 2015. 
[BGH+15]  Thomas Brihaye, Gilles Geeraerts, Axel Haddad, Engel Lefaucheux, and Benjamin Monmege. Simple priced timed games are not that simple. In FSTTCS'15, Leibniz International Proceedings in Informatics 45, pages 278292. LeibnizZentrum für Informatik, December 2015. 
[BMV15]  Dietmar Berwanger, Anup Basil Mathew, and Marie Van den Bogaard. Hierarchical Information Patterns and Distributed Strategy Synthesis. In ATVA'15, Lecture Notes in Computer Science 9364, pages 378393. SpringerVerlag, October 2015. 
[BSJ+15]  Nathalie Bertrand, Amélie Stainer, Thierry Jéron, and Moez Krichen. A game approach to determinize timed automata. Formal Methods in System Design 46(1):4280. SpringerVerlag, February 2015. 
[CDR+15]  Krishnendu Chatterjee, Laurent Doyen, Mickael Randour, and JeanFrançois Raskin. Looking at MeanPayoff and TotalPayoff through Windows. Information and Computation 242:2552. Elsevier, June 2015. 
[CLM15]  Petr Čermák, Alessio Lomuscio, and Aniello Murano. Verifying and Synthesising MultiAgent Systems against OneGoal Strategy Logic Specifications. In AAAI'15, pages 20382044. AAAI Press, January 2015. 
[DEG+15]  Antoine DurandGasselin, Javier Esparza, Pierre Ganty, and Rupak Majumdar. Model Checking Parameterized Asynchronous SharedMemory Systems. In CAV'15, Lecture Notes in Computer Science 9206, pages 6784. SpringerVerlag, July 2015. 
[DJL+15]  Alexandre David, Peter Gjøl Jensen, Kim Guldstrand Larsen, Marius Mikučionis, and Jakob Haar Taankvist. Uppaal Stratego. In TACAS'15, Lecture Notes in Computer Science 9035, pages 206211. SpringerVerlag, April 2015. 
[DKM+15]  Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, and Thomas Zeume. Reachability is in DynFO. In ICALP'15, Lecture Notes in Computer Science 9135, pages 159170. SpringerVerlag, July 2015. 
[DSQ+15]  Ankush Desai, Sanjit A. Seshia, Shaz Qadeer, David Broman, and John C. Eidson. Approximate synchrony: An abstraction for distributed almostsynchronous systems. In CAV'15, Lecture Notes in Computer Science 9206, pages 429448. SpringerVerlag, July 2015. 
[EGL+15]  Javier Esparza, Pierre Ganty, Jérôme Leroux, and Rupak Majumdar. Verification of Population Protocols. In CONCUR'15, Leibniz International Proceedings in Informatics 42, pages 470482. LeibnizZentrum für Informatik, September 2015. 
[Fou15]  Paulin Fournier. Parameterized verification of networks of many identical processes. Thèse de doctorat, Université Rennes 1, France, December 2015. 
[FT15]  Jie Fu and
Ufuk Topcu.
Computational methods for stochastic control with
metric interval temporal logic specifications.
Research Report 1503.07193, arXiv,
March 2015.

[Gan15]  Moses Ganardi. Parity Games of Bounded Tree and CliqueWidth. In FoSSaCS'15, Lecture Notes in Computer Science 9034, pages 390404. SpringerVerlag, April 2015. 
[HT15]  Frédéric Herbreteau and ThanhTung Tran. Improving Search Order for Reachability Testing in Timed Automata. In FORMATS'15, Lecture Notes in Computer Science 9268, pages 124139. SpringerVerlag, September 2015. 
[Hun15]  Paul Hunter. Reachability in Succinct OneCounter Games. In RP'15, Lecture Notes in Computer Science 9328, pages 3749. SpringerVerlag, September 2015. 
[JLR15]  Aleksandra Jovanović, Didier Lime, and Olivier H. Roux. Integer Parameter Synthesis for Timed Automata. IEEE Transactions on Software Engineering 41(5):445461. IEEE Comp. Soc. Press, May 2015. 
[JLS15]  Marcin Jurdziński, Ranko Lazić, and Sylvain Schmitz. FixedDimensional Energy Games are in PseudoPolynomial Time. In ICALP'15, Lecture Notes in Computer Science 9135, pages 260272. SpringerVerlag, July 2015. 
[KS15]  Denis Kuperberg and Michal Skrzypczak. On determinisation of goodforgames automata. In ICALP'15, Lecture Notes in Computer Science 9135, pages 299310. SpringerVerlag, July 2015. 
[KVW15]  Igor V. Konnov, Helmut Veith, and Josef Widder. SMT and POR bea Counter Abstraction: Parameterized Model Checking of ThresholdBased Distributed Algorithms. In CAV'15, Lecture Notes in Computer Science 9206, pages 85102. SpringerVerlag, July 2015. 
[LLZ15]  Kim Guldstrand Larsen,
Simon Laursen, and
Martin Zimmermann.
Limit Your Consumption! Finding Bounds in
Averageenergy Games.
Research Report 1510.05774, arXiv,
October 2015.

[MVZ15]  Pablo Muñoz,
Nils Vortmeier, and
Thomas Zeume.
Dynamic Graph Queries.
Research Report 1512.05511, arXiv,
December 2015.

[San15]  Ocan Sankur. Symbolic Quantitative Robustness Analysis of Timed Automata. In TACAS'15, Lecture Notes in Computer Science 9035, pages 484498. SpringerVerlag, April 2015. 
[Thi15]  Yann ThierryMieg. Symbolic ModelChecking Using ITSTools. In TACAS'15, Lecture Notes in Computer Science 9035, pages 231237. SpringerVerlag, April 2015. 
[VCD+15]  Yaron Velner, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Alexander Rabinovich, and JeanFrançois Raskin. The complexity of multimeanpayoff and multienergy games. Information and Computation 241:177196. Elsevier, April 2015. 
[Ves15]  Steen Vester. On the Complexity of Modelchecking Branching and Alternatingtime Temporal Logics in Onecounter systems. In ATVA'15, Lecture Notes in Computer Science 9364, pages 361377. SpringerVerlag, October 2015. 
[WSH15]  Farn Wang, Sven Schewe, and ChungHao Huang. An extension of ATL with Strategy Interaction. ACM Transactions on Programming Languages and Systems 37(3). ACM Press, June 2015. 
[Zeu15]  Thomas Zeume. Small Dynamic Complexity Classes. PhD thesis, Dortmund University, Germany, May 2015. 
Search
Displayed 47 resultsList of authors
 1
 1
 1
 1
 1
 1
 1
 1
 1
 2
 1
 1
 1
 1
 1
 7
 1
 2
 1
 1
 3
 1
 1
 1
 2
 1
 1
 1
 2
 1
 1
 2
 1
 1
 2
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 2
 1
 1
 2
 4
 2
 1
 1
 1
 1
 1
 2
 1
 11
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 2
 3
 1
 1
 2
 2
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 3
 1
 1