logo EDITE Franck PETIT
Identité
Franck PETIT
État académique
Thèse soutenue le 1998-01-01
Titulaire d'une HDR (ou équivalent) 2003-12-01
Laboratoire: personnel permanent
Direction de thèses (depuis 2007)
0.5
Propositions de sujets de thèse
Voisinage
Ellipse bleue: doctorant, ellipse jaune: docteur, rectangle vert: permanent, rectangle jaune: HDR. Trait vert: encadrant de thèse, trait bleu: directeur de thèse, pointillé: jury d'évaluation à mi-parcours ou jury de thèse.
Productions scientifiques
edite:133279229828
Snap-Stabilizing Message Forwarding Algorithm on Tree Topologies
;
13th International Conference on Distributed Computing and Networking (ICDCN 2012), Honk-Kong, China 2012
edite:1332792337111
Autour de l'Auto-Stabilisation: Partie~I : Techniques généralisant l'approche
Vol. 30, pp. 1-22 2011
edite:1332792336106
Asymptotically Optimal Deterministic Rendezvous
Vol. 22, No. 5, pp. 1143-1159 2011
edite:1332792337112
Autour de l'Auto-Stabilisation: Partie~II : Techniques spécialisant l'approche
Vol. 30, pp. 23-50 2011
http://doi.ieeecomputersociety.org/10.1109/IPDPS.2011.31
Snap-Stabilizing Committee Coordination
25th IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2011 2011
edite:1332792443533
Best-effort group service in dynamic networks
SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallel Algorithms and Architectures 2010
edite:1332792445542
Brief announcement: leader election vs pattern formation
PODC 2010
edite:1332792451592
Deterministic Robot-Network Localization is Hard
Vol. 26, No. 2, pp. 331-339 2010
edite:1332792466681
Leader Election Problem versus Pattern Formation Problem
24th International Symposium Distributed Computing DISC 2010
edite:1332792491797
Reliability, Availibility, and Security, 3rd International Workshop (WRAS 2010)
WRAS 2010
edite:1332792500823
Snap-Stabilizing Linear Message Forwarding
12th International Symposium Stabilization, Safety, and Security of Distributed Systems, SSS 2010
edite:1332792500824
Snap-Stabilizing Prefix Tree for Peer-to-Peer Systems
Vol. 20, No. 1, pp. 15-30 2010
edite:1332792531993
Brief Announcement: Deaf, Dumb, and Chatting Robots
28th Annual ACM Symposium on Principles of Distributed Computing (PODC 2009), Calgary, Canada 2009
edite:13327925341033
Deaf, Dumb, and Chatting Robots: Enabling Distributed Computation and Fault-Tolerance Among Stigmergic Robots
Thirteenth International Conference On Principle Of DIstributed Systems (OPODIS 2009), N\^imes, France 2009
edite:13327925421076
Exploration Optimale Probabiliste d'un Anneau par des Robots Asynchrones et Amnésiques
$11^\mboxi\`emes$ rencontres francophones sur les aspects algorithmiques des t\'el\'ecommunications (Algotel 2009), Carry-Le-Rouet, France 2009
http://hal.inria.fr/inria-00383351
Exploration Optimale Probabiliste d'un Anneau par des Robots Semi-Synchrones et Amnésiques
Nous considérons une cohorte de k robots mobiles identiques, amnésiques et semi-synchrones, capables de percevoir leur environnement mais pas de communiquer, qui évoluent sur des chemins contraints. Les résultats précédents dans ce contexte montre que les situations initiales symétriques induisent des bornes inférieures élevées quand les probl`emes doivent etre résolus par des robots déterministes. Nous initions l'étude des bornes et solutions probabilistes dans le meme contexte, et considérons le probl`eme de l'exploration d'anneaux anonymes et non orientés de taille n quelconque. Il est connu que Theta(log n) robots sont nécessaires et suffisants pour résoudre le probl`eme avec k robots déterministes, quand k et n sont premiers entre eux. Nous montrons que quatre robots probabilistes identiques sont nécessaires et suffisants pour résoudre le meme probl`eme, tout en supprimant la contrainte de coprimalité. Nos résultats positifs sont constructifs.
Proceedings of Algotel 2009 2009
http://hal.inria.fr/inria-00360305/fr/
Optimal Probabilistic Ring Exploration by Asynchronous Oblivious Robots
We consider a team of k identical, oblivious, asynchronous mobile robots that are able to sense (i.e., view) their environment, yet are unable to communicate, and evolve on a constrained path. Previous results in this weak scenario show that initial symmetry yields high lower bounds when problems are to be solved by deterministic robots. In this paper, we initiate research on probabilistic bounds and solutions in this context, and focus on the exploration problem of anonymous unoriented rings of any size. It is known that Theta(log n) robots are necessary and sufficient to solve the problem with k deterministic robots, provided that k and n are coprime. By contrast, we show that four identical probabilistic robots are necessary and sufficient to solve the same problem, also removing the coprime constraint. Our positive results are constructive.
Proceedings of Sirocco 2009, Piran, Slovenia 2009
edite:13327925551204
Optimal Probabilistic Ring Exploration by Semi-Synchronous Oblivious Robots
16th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2009), Piran, Slovenia 2009
edite:13327925561220
Peer-to-Peer Service Discovery for Grid Computing
2009
edite:13327925601237
Quand le consensus est plus simple que la diffusion fiable
$11^\mboxi\`emes$ rencontres francophones sur les aspects algorithmiques des t\'el\'ecommunications (Algotel 2009), Carry-Le-Rouet, France 2009
edite:13327925601247
Scatter of Weak Robots
Vol. 19, No. 1, pp. 175-184 2009
edite:13327925611253
Self-stabilizing Deterministic Gathering
5th International Workshop on Algorithmic Aspects of Wireless Sensor Networks (Algosensors 2009), Rhodes, Greece 2009
edite:13327925621270
Space-Optimal Deterministic Rendezvous
Second International Workshop on Reliability, Availability, and Security (WRAS 2009), Hiroshima, Japan 2009
edite:13327925621272
Squaring the Circle with Weak Mobile Robots
$11^\mboxi\`emes$ rencontres francophones sur les aspects algorithmiques des t\'el\'ecommunications (Algotel 2009), Carry-Le-Rouet, France 2009