On the Verification of Timed Ad Hoc Networks, Proceedings of Formats'11, pp.256-270, 2011. ,
DOI : 10.1007/978-3-642-04081-8_40
Model checking of systems with many identical timed processes, Theoretical Computer Science, vol.290, issue.1, pp.241-263, 2003. ,
DOI : 10.1016/S0304-3975(01)00330-9
On regularity of unary probabilistic automata, Proceedings of STACS'16, volume 47 of Leibniz International Proceedings in Informatics Leibniz-Zentrum für Informatik, pp.1-8, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01245037
Computation in networks of passively mobile finite-state sensors, Proceedings of PODC'04, pp.290-299, 2004. ,
Games for synthesis of controllers with partial observation, Theoretical Computer Science, vol.303, issue.1, pp.7-34, 2003. ,
DOI : 10.1016/S0304-3975(02)00442-5
Controlling a population ,
URL : https://hal.archives-ouvertes.fr/hal-01558029
Parameterized verification of many identical probabilistic timed processes, Proceedings of FSTTCS'13, volume 24 of Leibniz International Proceedings in Informatics Leibniz-Zentrum für Informatik, pp.501-513, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00914263
Playing with Probabilities in Reconfigurable Broadcast Networks, Proceedings of FoSSaCS'14, pp.134-148, 2014. ,
DOI : 10.1007/978-3-642-54830-7_9
URL : https://hal.archives-ouvertes.fr/hal-01082129
Reachability Games on Extended Vector Addition Systems with States, Proceedings of ICALP'10, pp.478-489, 2010. ,
DOI : 10.1007/978-3-642-14162-1_40
Deciding parity games in quasipolynomial time, Proceedings of STOCS'17, pp.252-263, 2017. ,
Infinite synchronizing words for probabilistic automata (erratum), 1206. ,
DOI : 10.1007/978-3-642-22993-0_27
URL : http://www.lsv.ens-cachan.fr/~doyen/papers/Infinite_Synchronizing_Words_for_Probabilistic_Automata.pdf
Limit Synchronization in Markov Decision Processes, Proceedings of FoSSaCS'14, pp.58-72, 2014. ,
DOI : 10.1007/978-3-642-54830-7_4
URL : http://arxiv.org/abs/1310.2935
Keeping a crowd safe: On the complexity of parameterized verification (invited talk), Proceedings of STACS'14 Leibniz-Zentrum für Informatik, pp.1-10, 2014. ,
On the verification of broadcast protocols, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158), pp.352-359, 1999. ,
DOI : 10.1109/LICS.1999.782630
Verification of population protocols, Proceedings of CONCUR'15, volume 42 of Leibniz International Proceedings in Informatics Leibniz-Zentrum für Informatik, pp.470-482, 2015. ,
DOI : 10.1007/978-3-642-02658-4_59
URL : https://link.springer.com/content/pdf/10.1007%2Fs00236-016-0272-3.pdf
Reasoning about systems with many processes, Journal of the ACM, vol.39, issue.3, pp.675-735, 1992. ,
DOI : 10.1145/146637.146681
URL : http://www.neng.usu.edu/ece/faculty/bunker/rlist/p675-german.pdf
Probabilistic Automata on Finite Words: Decidable and Undecidable Problems, Proceedings of ICALP'10, pp.527-538, 2010. ,
DOI : 10.1007/978-3-642-14162-1_44
URL : https://hal.archives-ouvertes.fr/hal-00456538
Small Progress Measures for Solving Parity Games, Proceedings of STACS'00, pp.290-301, 2000. ,
DOI : 10.1007/3-540-46541-3_24
Clearly, (q, t k ) / ? G[i, k], else (q, x j ) ? G[i, j], which is not true. Last, y j+1 is a common successor of t k and r k , that is (t k , y j+1 ) ? G[k, j + 1] and (r k ,