Pierre Courtieu
- J. Adamek, M. Nesterenko, and S. Tixeuil. Evaluating and optimizing stabilizing dining philosophers. In 11th European Dependable Computing Conference, EDCC 2015, Paris, France, September 7--11, 2015, pages 233--244. IEEE, 2015. Google Scholar
Digital Library
- C. Auger, Z. Bouzid, P. Courtieu, S. Tixeuil, and X. Urbain. Certified Impossibility Results for Byzantine-Tolerant Mobile Robots. In T. Higashino, Y. Katayama, T. Masuzawa, M. Potop-Butucaru, and M. Yamashita, editors, Stabilization, Safety, and Security of Distributed Systems - 15th International Symposium (SSS 2013), volume 8255 of Lecture Notes in Computer Science, pages 178--186, Osaka, Japan, Nov. 2013. Springer-Verlag.Google Scholar
- B. Bérard, P. Courtieu, L. Millet, M. Potop-Butucaru, L. Rieg, N. Sznajder, S. Tixeuil, and X. Urbain. Formal Methods for Mobile Robots: Current Results and Open Problems. International Journal of Informatics Society, 7(3):101--114, 2015. Invited Paper.Google Scholar
- B. Bérard, P. Lafourcade, L. Millet, M. Potop-Butucaru, Y. Thierry-Mieg, and S. Tixeuil. Formal verification of Mobile Robot Protocols. phDistributed Computing, 2016.Google Scholar
- F. Bonnet, X. Défago, F. Petit, M. Potop-Butucaru, and S. Tixeuil. Discovering and assessing fine-grained metrics in robot networks protocols. In 33rd IEEE International Symposium on Reliable Distributed Systems Workshops, SRDS Workshops 2014, Nara, Japan, October 6--9, 2014, pages 50--59. IEEE, 2014. Google ScholarDigital Library
- P. Courtieu, L. Rieg, S. Tixeuil, and X. Urbain. A Certified Universal Gathering Algorithm for Oblivious Mobile Robots. CoRR, abs/1506.01603, 2015.Google Scholar
- P. Courtieu, L. Rieg, S. Tixeuil, and X. Urbain. Impossibility of Gathering, a Certification. Information Processing Letters, 115:447--452, 2015.Google ScholarCross Ref
- P. Courtieu, L. Rieg, S. Tixeuil, and X. Urbain. Certified Universal Gathering Algorithm in $\mathbbR^2$ for Oblivious Mobile Robots. CoRR, abs/1602.08361, 2016.Google Scholar
- S. Devismes, A. Lamani, F. Petit, P. Raymond, and S. Tixeuil. Optimal Grid Exploration by Asynchronous Oblivious Robots. In A. W. Richa and C. Scheideler, editors, Stabilization, Safety, and Security of Distributed Systems - 14th International Symposium (SSS 2012), volume 7596 of Lecture Notes in Computer Science, pages 64--76, Toronto, Canada, Oct. 2012. Springer-Verlag. Google ScholarDigital Library
- P. Flocchini, G. Prencipe, and N. Santoro. Distributed Computing by Oblivious Mobile Robots. Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers, 2012. Google ScholarDigital Library
- W. A. Howard. The formulae-as-types notion of construction. In J. R. H. Jonathan P. Seldin, editor, To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 479--490. Academic Press, London, 1980.Google Scholar
- L. Millet, M. Potop-Butucaru, N. Sznajder, and S. Tixeuil. On the synthesis of mobile robots algorithms: The case of ring gathering. In P. Felber and V. K. Garg, editors, Stabilization, Safety, and Security of Distributed Systems - 16th International Symposium, (SSS 2014), volume 8756 of Lecture Notes in Computer Science, pages 237--251, Paderborn, Germany, sep 2014. Springer-Verlag.Google Scholar
- I. Suzuki and M. Yamashita. Distributed Anonymous Mobile Robots: Formation of Geometric Patterns. SIAM Journal of Computing, 28(4):1347--1363, 1999. Google ScholarDigital Library
Index Terms
- Brief Announcement: Certified Universal Gathering in R2 for Oblivious Mobile Robots
Recommendations
Brief Announcement: Complete Visibility for Oblivious Robots in Linear Time
SPAA '17: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and ArchitecturesWe consider the distributed setting of $N$ autonomous mobile robots that operate in Look-Compute-Move cycles following the well-celebrated classic oblivious robots model. We study the fundamental problem where starting from an arbitrary initial ...
Brief announcement: wait-free gathering of mobile robots
DISC'12: Proceedings of the 26th international conference on Distributed ComputingRobot Systems. This paper considers distributed systems of autonomous robots that can move freely on the two-dimensional Euclidean space, have visibility sensors (to see other robots, obstacles etc.) and can perform computations. One of the fundamental ...
Brief announcement: impossibility results for optimistic fair exchange with multiple autonomous arbiters
PODC '09: Proceedings of the 28th ACM symposium on Principles of distributed computingFair exchange is one of the most fundamental problems in secure distributed computation. Alice has something that Bob wants, and Bob has something that Alice wants. A fair exchange protocol would guarantee that, even if one of them maliciously deviates ...
Comments