2020  

[ALM20]  Étienne André, Didier Lime, and Nicolas Markey. Languagepreservation problems in parametric timed automata. Logical Methods in Computer Science 16(1). January 2020. 
[GBM20]  Patrick Gardy, Patricia Bouyer, and Nicolas Markey. Dependences in Strategy Logic. Theory of Computing Systems 64(3):467507. SpringerVerlag, April 2020. 
[BMS+20]  Nathalie Bertrand, Nicolas Markey, Suman Sadhukhan, and Ocan Sankur. Dynamic network congestion games. In FSTTCS'20, Leibniz International Proceedings in Informatics 182, pages 40:140:16. LeibnizZentrum für Informatik, December 2020. 
[CJM+20]  Emily Clement, Thierry Jéron, Nicolas Markey, and David Mentré. Computing maximallypermissive strategies in acyclic timed automata. In FORMATS'20, Lecture Notes in Computer Science 12288, pages 111126. SpringerVerlag, September 2020. 
[HJM20]  Léo Henry, Thierry Jéron, and Nicolas Markey. Active learning of timed automata with unobservable resets. In FORMATS'20, Lecture Notes in Computer Science 12288, pages 144160. SpringerVerlag, September 2020. 
[JMM+20]  Thierry Jéron, Nicolas Markey, David Mentré, Reiya Noguchi, and Ocan Sankur. Incremental methods for checking realtime consistency. In FORMATS'20, Lecture Notes in Computer Science 12288, pages 249264. SpringerVerlag, September 2020. 
[ACZ+20]  Jie An, Mingshuai Chen, Bohua Zhan, Naijun Zhan, and Miaomiao Zhang. Learning OneClock Timed Automata. In TACAS'20 (Part I), Lecture Notes in Computer Science 12078, pages 444462. SpringerVerlag, April 2020. 
[AHK20]  Guy Avni, Thomas A. Henzinger, and Orna Kupferman. Dynamic Resource Allocation Games. Theoretical Computer Science 807:4255. Elsevier, February 2020. 
[AMP+20]  Gal Amram,
Shahar Maoz,
Or Pistiner, and
Jan Oliver Ringert.
Energy μCalculus: Symbolic FixedPoint
Algorithms for ωRegular Energy Games.
Technical Report 2005.00641, arXiv,
May 2020.

[BFF+20]  Raphaël Berthon,
Nathanaël Fijalkow,
Emmanuel Filiot,
Shibashis Guha,
Bastien Maubert,
Aniello Murano,
Laureline Pinault,
Sophie Pinchinat,
Sasha Rubin, and
Olivier Serre.
Alternating Tree Automata with Qualitative
Semantics.
Technical Report 200203664, arXiv,
February 2020.

[BKL+20]  Udi Boker, Denis Kuperberg, Karoliina Lehtinen, and Michal Skrzypczak. On succinctness and recognisability of alternating goodforgames automata. In FSTTCS'20, Leibniz International Proceedings in Informatics 182, pages 41:141:13. LeibnizZentrum für Informatik, December 2020. 
[CCM+20]  Riccardo ColiniBaldeschi, Roberto Cominetti, Panayotis Mertikopoulos, and Marco Scarsini. When is selfish routing bad? The price of anarchy in light and heavy traffic. Operations Research 68(2):411434. Informs, April 2020. 
[Had20]  Christoforos N. Hadjicostis. Estimation and Inference in Discrete Event Systems – A modelbased approach with finite automata. Communications and Control Engineering. SpringerVerlag, 2020. 
[LZ20]  Karoliina Lehtinen and Martin Zimmermann. Goodforgames ωpushdown automata. In LICS'20, pages 689702. IEEE Comp. Soc. Press, July 2020. 
[MMP+20]  Bastien Maubert,
Aniello Murano,
Sophie Pinchinat,
François Schwarzentruber, and
Silvia Stranieri.
Dynamic Epistemic Logic Games with Epistemic
Temporal Goals.
Technical Report 200107141, arXiv,
January 2020.

[Rou20]  Victor Roussanaly. Efficient verification of realtime systems. Thèse de doctorat, Université Rennes 1, France, November 2020. 
[Wol20]  Petra Wolf. Synchronization under Dynamic Constraints. In FSTTCS'20, Leibniz International Proceedings in Informatics 182, pages 58:158:14. LeibnizZentrum für Informatik, December 2020. 
Search
Displayed 17 resultsList of authors
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1
 3
 1
 1
 2
 1
 1
 6
 2
 2
 1
 2
 1
 1
 2
 1
 1
 1
 1
 1
 2
 1
 1
 1
 1
 1
 1
 1
 1
 1
 1