2018  

[BMR+18]  Patricia Bouyer, Nicolas Markey, Mickael Randour, Kim Guldstrand Larsen, and Simon Laursen. Averageenergy games. Acta Informatica 55(2):91127. SpringerVerlag, March 2018. 
[LFM+18]  Adrien Le Coënt, Laurent Fribourg, Nicolas Markey, Florian De Vuyst, and Ludovic Chamoin. Distributed Synthesis of StateDependent Switching Control. Theoretical Computer Science 750:5368. Elsevier, November 2018. 
[BBF+18]  Giovanni Bacci, Patricia Bouyer, Uli Fahrenberg, Kim Guldstrand Larsen, Nicolas Markey, and PierreAlain Reynier. Optimal and Robust Controller Synthesis Using Energy Timed Automata with Uncertainty. In FM'18, Lecture Notes in Computer Science 10951, pages 203221. SpringerVerlag, July 2018. 
[BBM18]  A. R. Balasubramanian, Nathalie Bertrand, and Nicolas Markey. Parameterized verification of synchronization in constrained reconfigurable broadcast networks. In TACAS'18 (Part II), Lecture Notes in Computer Science 10806, pages 3854. SpringerVerlag, April 2018. 
[BGM+18]  Patricia Bouyer, Mauricio González, Nicolas Markey, and Mickael Randour. Multiweighted Markov Decision Processes with Reachability Objectives. In GandALF'18, Electronic Proceedings in Theoretical Computer Science 277, pages 250264. September 2018. 
[BJM18]  Patricia Bouyer, Samy Jaziri, and Nicolas Markey. Efficient timed diagnosis using automata with timed domains. In RV'18, Lecture Notes in Computer Science 11237, pages 205221. SpringerVerlag, November 2018. 
[GBM18]  Patrick Gardy, Patricia Bouyer, and Nicolas Markey. Dependences in Strategy Logic. In STACS'18, Leibniz International Proceedings in Informatics 96, pages 34:134:14. LeibnizZentrum für Informatik, February 2018. 
[HJM18]  Léo Henry, Thierry Jéron, and Nicolas Markey. Control strategies for offline testing of timed systems. In SPIN'18, Lecture Notes in Computer Science 10869, pages 171189. SpringerVerlag, June 2018. 
[BFL+18]  Patricia Bouyer, Uli Fahrenberg, Kim Guldstrand Larsen, Nicolas Markey, Joël Ouaknine, and James Worrell. Model Checking RealTime Systems. In Edmund M. Clarke, Thomas A. Henzinger, Helmut Veith, and Roderick Bloem (eds.), Handbook of Model Checking. SpringerVerlag, May 2018. 
[AGK18]  Guy Avni, Shibashis Guha, and Orna Kupferman. Timed Network Games with Clocks. In MFCS'18, Leibniz International Proceedings in Informatics 117, pages 23:123:18. LeibnizZentrum für Informatik, August 2018. 
[AKP18]  Shaull Almagor, Orna Kupferman, and Giuseppe Perelli. Synthesis of Controllable Nash Equilibria in Quantitative Objective Games. In IJCAI'18, pages 3541. IJCAI organization, July 2018. 
[AMM+18]  Benjamin Aminof, Vadim Malvone, Aniello Murano, and Sasha Rubin. Graded modalities in Strategy Logic. Information and Computation 261(4):634649. Elsevier, August 2018. 
[BEK18]  Michael Blondin, Javier Esparza, and Antonín Kučera. Automatic Analysis of Expected Termination Time for Population Protocols. In CONCUR'18, Leibniz International Proceedings in Informatics 118, pages 33:133:16. LeibnizZentrum für Informatik, September 2018. 
[BF18]  Ezio Bartocci and Yliès Falcone. Lectures on Runtime Verification. Lecture Notes in Computer Science 10457. SpringerVerlag, 2018. 
[BGM+18]  Damien BusattoGaston, Benjamin Monmege, and PierreAlain Reynier. Symbolic Approximation of Weighted Timed Games. In FSTTCS'18, Leibniz International Proceedings in Informatics 122, pages 28:128:16. LeibnizZentrum für Informatik, December 2018. 
[BK18]  Marc Bagnol and Denis Kuperberg. Büchi Goodforgame Automata are Efficiently Recognizable. In FSTTCS'18, Leibniz International Proceedings in Informatics 122, pages 16:116:14. LeibnizZentrum für Informatik, December 2018. 
[Bok18]  Udi Boker. Why these automata types?. In LPAR'18, EPiC Series in Computing 57, pages 143163. EasyChair, November 2018. 
[CHV+18]  Edmund M. Clarke, Thomas A. Henzinger, Helmut Veith, and Roderick Bloem. Handbook of Model Checking. SpringerVerlag, April 2018. 
[DM18]  Dario Della Monica and
Aniello Murano.
Parityenergy ATL for Qualitative and Quantitative
Reasoning in MAS.
In AAMAS'18,
pages 14411449.
International Foundation for Autonomous Agents and
Multiagent Systems, July 2018.

[DMP18]  Cătălin Dima, Bastien Maubert, and Sophie Pinchinat. Relating Paths in Transition Systems: The Fall of the Modal MuCalculus. ACM Transactions on Computational Logic 19(3):23:123:33. ACM Press, September 2018. 
[FMM+18]  Nathanaël Fijalkow, Bastien Maubert, Aniello Murano, and Sasha Rubin. Quantifying Bounds in Strategy Logic. In CSL'18, Leibniz International Proceedings in Informatics 119, pages 23:123:23. LeibnizZentrum für Informatik, September 2018. 
[Had18]  Serge Haddad. Memoryless determinacy of finite parity games: Another simple proof. Information Processing Letters 132:1921. Elsevier, April 2018. 
[HvdM18]  Xiaowei Huang and Ron van der Meyden. An Epistemic Strategy Logic. ACM Transactions on Computational Logic 19(4):26:126:45. ACM Press, December 2018. 
[HMM18]  Loïc Hélouët, Hervé Marchand, and John Mullins. Concurrent secrets with quantified suspicion. In ACSD'18, pages 7584. IEEE Comp. Soc. Press, June 2018. 
[JW18]  Paulin Jacquot and Cheng Wan. Routing game on parallel networks: the convergence of atomic to nonatomic. In CDC'18, pages 69516956. IEEE Comp. Soc. Press, December 2018. 
[LLH18]  Stéphane Lafortune, Feng Lin, and Christoforos N. Hadjicostis. On the history of diagnosability and opacity in discrete event systems. Annual Reviews in Control 45:257266. Elsevier, 2018. 
[Szy18]  Marek Szykuła. Improving the Upper Bound on the Length of the Shortest Reset Word. In STACS'18, Leibniz International Proceedings in Informatics 96, pages 56:156:13. LeibnizZentrum für Informatik, February 2018. 
Search
Displayed 27 resultsList of authors
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 6
 1
 1
 1
 1
 1
 1
 1
 2
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 2
 1
 3
 1
 1
 1
 1
 1
 9
 2
 1
 1
 3
 1
 1
 1
 2
 2
 2
 1
 1
 1
 1
 1