Realizable and unrealizable specifications of reactive systems, Proc. of ICALP'89, pp.1-17, 1989. ,
DOI : 10.1007/BFb0035748
Certified Impossibility Results for Byzantine-Tolerant Mobile Robots, Proc. of SSS, pp.178-190, 2013. ,
DOI : 10.1007/978-3-319-03089-0_13
URL : https://hal.archives-ouvertes.fr/hal-00834633
Vérification formelle et robots mobiles, Proc. of Algotel 2013, 2013. ,
Brief Announcement: Discovering and Assessing Fine-Grained Metrics in Robot Networks Protocols, Proc. of SSS 2012, pp.282-284, 2012. ,
DOI : 10.1007/978-3-642-33536-5_28
URL : https://hal.archives-ouvertes.fr/hal-00934186
Solving sequential conditions by finite-state strategies, Transactions of the American Mathematical Society, vol.138, pp.295-311, 1969. ,
DOI : 10.1090/S0002-9947-1969-0280205-0
Logic, arithmetics, and automata, Proc. of Int. Congr. of Mathematicians, pp.23-35, 1963. ,
Design and synthesis of synchronization skeletons using branching time temporal logic, Proc. of IBM Workshop on Logics of Programs, 1981. ,
Gathering and exclusive searching on rings under minimal assumptions, Proc of ICDCN 2014, pp.149-164, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-00931514
How to gather asynchronous oblivious robots on anonymous rings, Proc. of DISC 2012, pp.326-340, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00728979
A unified approach for different tasks on rings in robot-based computing systems, IPDPS Workshops, pp.667-676, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00845546
Optimal Grid Exploration by Asynchronous Oblivious Robots, Proc. of SSS, pp.64-76, 2012. ,
DOI : 10.1007/978-3-642-33536-5_7
URL : https://hal.archives-ouvertes.fr/hal-00934161
Distributed Computing by Oblivious Mobile Robots, Synthesis Lectures on Distributed Computing Theory, vol.3, issue.2, 2012. ,
DOI : 10.2200/S00440ED1V01Y201208DCT010
Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings, Proc. of SIROCCO, pp.101-113, 2010. ,
DOI : 10.1007/978-3-642-13284-1_9
Asynchronous Mobile Robot Gathering from Symmetric Configurations without Global Multiplicity Detection, Proc. of SIROCCO, pp.150-161, 2011. ,
DOI : 10.1007/11429647_20
URL : https://hal.archives-ouvertes.fr/hal-01009454
Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection, Proc. of MFCS, pp.542-553, 2012. ,
DOI : 10.1007/978-3-642-32589-2_48
URL : https://hal.archives-ouvertes.fr/hal-00934132
Gathering asynchronous oblivious mobile robots in a ring, Theoretical Computer Science, vol.390, issue.1, pp.27-39, 2008. ,
DOI : 10.1016/j.tcs.2007.09.032
URL : https://hal.archives-ouvertes.fr/hal-00307234
Synthesis of Communicating Processes from Temporal Logic Specifications, ACM Transactions on Programming Languages and Systems, vol.6, issue.1, pp.68-93, 1984. ,
DOI : 10.1145/357233.357237
Infinite Games, Automata, Logics, and Infinite Games, pp.23-42, 2001. ,
DOI : 10.1007/3-540-36387-4_2
On the self-stabilization of mobile oblivious robots in uniform rings, Proc. of SSS, pp.49-63, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00934149
Multiple-person alternation, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979), pp.348-363, 1979. ,
DOI : 10.1109/SFCS.1979.25
On the synthesis of a reactive module, Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '89, pp.179-190, 1989. ,
DOI : 10.1145/75277.75293
Optimal Gathering of Oblivious Robots in Anonymous Graphs, Proc. of SIROCCO, pp.213-224, 2013. ,
DOI : 10.1016/j.tcs.2007.04.023
Distributed Anonymous Mobile Robots: Formation of Geometric Patterns, SIAM Journal on Computing, vol.28, issue.4, pp.1347-1363, 1999. ,
DOI : 10.1137/S009753979628292X