Certified Impossibility Results for Byzantine-Tolerant Mobile Robots-Reference-Cited by-同舟云学术

Certified Impossibility Results for Byzantine-Tolerant Mobile Robots

Published:2013 Issue: Volume: Page:178-190
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Auger Cédric,Bouzid Zohir,Courtieu Pierre,Tixeuil Sébastien,Urbain Xavier

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-03089-0_13

Reference31 articles.

1. Agmon, N., Peleg, D.: Fault-tolerant gathering algorithms for autonomous mobile robots. SIAM Journal on Computing 36(1), 56–82 (2006)

2. Almeida, J.B., Barbosa, M., Bangerter, E., Barthe, G., Krenn, S., Béguelin, S.Z.: Full Proof Cryptography: Verifiable Compilation of Efficient Zero-Knowledge Protocols. In: Yu, T., Danezis, G., Gligor, V.D. (eds.) ACM Conference on Computer and Communications Security, pp. 488–500. ACM (2012)

3. Berard, B., Millet, L., Potop-Butucaru, M., Thierry-Mieg, Y., Tixeuil, S.: Formal verification of Mobile Robot Protocols. Technical report (May 2013)

4. Bezem, M., Bol, R., Groote, J.F.: Formalizing Process Algebraic Verifications in the Calculus of Constructions. Formal Aspects of Computing 9, 1–48 (1997)

5. Lecture Notes in Computer Science;F. Bonnet,2012

Cited by 41 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Using model checking to formally verify rendezvous algorithms for robots with lights in Euclidean space;Robotics and Autonomous Systems;2023-05

2. Certification of an exact worst-case self-stabilization time;Theoretical Computer Science;2023-01

3. Verification of agent navigation in partially-known environments;Artificial Intelligence;2022-07

4. Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots;Theoretical Computer Science;2021-10

5. Byzantine Dispersion on Graphs;2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2021-05