Sébastien Tixeuil
21
Documents
Publications
- 21
- 18
- 16
- 9
- 6
- 3
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
Swarms of Mobile Robots: Towards Versatility with SafetyLeibniz Transactions on Embedded Systems, 2022, Special Issue on Distributed Hybrid Systems, 8 (2), pp.02:1-02:36. ⟨10.4230/LITES.8.2.2⟩
Article dans une revue
hal-03901898v1
|
|
Synchronous Gathering without Multiplicity Detection: a Certified AlgorithmTheory of Computing Systems, 2019, 63 (2), pp.200-218. ⟨10.1007/s00224-017-9828-z⟩
Article dans une revue
hal-01894618v1
|
|
Impossibility of gathering, a certificationInformation Processing Letters, 2015, 115 (3), pp.447-452. ⟨10.1016/j.ipl.2014.11.001⟩
Article dans une revue
hal-01122869v1
|
|
[Invited Paper] Formal Methods for Mobile Robots: Current Results and Open ProblemsInternational Journal of Informatics Society, 2015, 7 (3), pp.101-114
Article dans une revue
hal-01238784v1
|
|
Du discrètement continu au continûment discretALGOTEL 2020 – 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Sep 2020, Lyon, France
Communication dans un congrès
hal-02871295v1
|
Continuous vs. Discrete Asynchronous Moves: A Certified Approach for Mobile Robots7th International Conference on NETworked sYStems (NETYS 2019), Jun 2019, Marrakech, Morocco. pp.93-09, ⟨10.1007/978-3-030-31277-0_7⟩
Communication dans un congrès
hal-02115599v1
|
|
|
Manuel de savoir-prouver à l’usage des roboteux et des distributeuxALGOTEL 2019 - 21èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2019, Saint Laurent de la Cabrerisse, France. pp.1-4
Communication dans un congrès
hal-02115611v1
|
Brief Announcement Continuous vs. Discrete Asynchronous Moves: A Certified Approach for Mobile RobotsStabilization, Safety, and Security of Distributed Systems. SSS 2018., Xavier Defago, Toshimitsu Masuzawa, Koichi Wada, Nov 2018, Tokyo, Japan. pp.404-408, ⟨10.1007/978-3-030-03232-6_29⟩
Communication dans un congrès
hal-01937420v1
|
|
Certified Gathering of Oblivious Mobile Robots: survey of recent results and open problemsFormal Methods for Industrial Critical Systems and Automated Verification of Critical Systems (FMICS/AVOCS), Sep 2017, Turin, Italy. pp.165-181, ⟨10.1007/978-3-319-67113-0_11⟩
Communication dans un congrès
hal-01549942v1
|
|
A Certified Universal Gathering Algorithm for Oblivious Mobile RobotsDistributed Computing (DISC), Sep 2016, Paris, France
Communication dans un congrès
hal-01349061v1
|
|
Brief announcement: Certified Universal Gathering in R2 for Oblivious Mobile RobotsACM Conference on Principles of Distributed Computing (PODC), ACM, Jul 2016, Chicago, United States
Communication dans un congrès
hal-01349084v1
|
|
Synchronous Gathering Without Multiplicity Detection: A Certified AlgorithmInternational Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2016), Nov 2016, Lyon, France. pp.7-19, ⟨10.1007/978-3-319-49259-9_2⟩
Communication dans un congrès
hal-01491813v1
|
|
Certified Impossibility Results for Byzantine-Tolerant Mobile RobotsInternational Symposium on Stabilization, Safety, and Security of Distributed Systems, Nov 2013, Osaka, Japan. pp.178-190, ⟨10.1007/978-3-319-03089-0_13⟩
Communication dans un congrès
hal-00930267v1
|
|
Brief Announcement: Certified impossibility results for Byzantine-tolerant mobile robotsInternational Symposium on Distributed Computing (DISC2013), Oct 2013, Jerusalem, Israel. pp.2
Communication dans un congrès
hal-01126335v1
|
Formal Methods for Mobile RobotsPaola Flocchini; Giuseppe Prencipe; Nicola Santoro. Distributed Computing by Mobile Entities, Current Research in Moving and Computing, 11340, Springer International Publishing, pp.278-313, 2019, Theoretical Computer Science and General Issues, 978-3-030-11071-0. ⟨10.1007/978-3-030-11072-7_12⟩
Chapitre d'ouvrage
hal-01981634v1
|
|
Computer Aided Formal Design of Swarm Robotics Algorithms2021
Pré-publication, Document de travail
hal-03111541v1
|
|
Continuous vs. Discrete Asynchronous Moves: a Certified Approach for Mobile Robots[Research Report] Sorbonne Université, CNRS, Laboratoire d’Informatique de Paris 6, LIP6, F-75005 Paris, France. 2018, pp.1-12
Rapport
hal-01762962v1
|
|
Certified Universal Gathering in $R^2$ for Oblivious Mobile Robots[Research Report] UPMC; CNAM. 2016
Rapport
hal-01274295v1
|
|
A Certified Universal Gathering Algorithm for Oblivious Mobile Robots[Research Report] UPMC, Sorbonne Universites CNRS; CNAM, Paris; College de France; Université Paris Sud. 2015
Rapport
hal-01159890v1
|
|
Impossibility of Gathering, a Certification[Technical Report] CEDRIC-14-3016, CEDRIC laboratory, CNAM-Paris, France. 2014, pp.10
Rapport
hal-00995126v1
|
|
Certified Impossibility Results for Byzantine-Tolerant Mobile Robots[Research Report] 1560, LRI - CNRS, University Paris-Sud. 2013
Rapport
hal-00834633v1
|