Case Study on Certifying Distributed Algorithms: Reducing Intrusiveness - Fundamentals of Software Engineering Access content directly
Conference Papers Year : 2019

Case Study on Certifying Distributed Algorithms: Reducing Intrusiveness

Abstract

Certifying distributed algorithms (CDAs) are a runtime verification method for distributed systems. A CDA computes additionally a witness to an input-output pair – a correctness argument for the pair. The witness is verified at runtime by a distributed checker algorithm. In this paper, we apply CDAs to an industrial case study of collaborative transport robots serving machines in a factory. In particular, we present a certifying variant of a distributed bidding algorithm executed by the robots to assign transport jobs amongst each other. Furthermore, we introduce overlays in order to organize the communication of the distributed checker, and compare them regarding their intrusiveness.
Fichier principal
Vignette du fichier
490001_1_En_12_Chapter.pdf (414.04 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03769129 , version 1 (05-09-2022)

Licence

Attribution

Identifiers

Cite

Samira Akili, Kim Völlinger. Case Study on Certifying Distributed Algorithms: Reducing Intrusiveness. 8th International Conference on Fundamentals of Software Engineering (FSEN), May 2019, Tehran, Iran. pp.179-185, ⟨10.1007/978-3-030-31517-7_12⟩. ⟨hal-03769129⟩
14 View
21 Download

Altmetric

Share

Gmail Facebook X LinkedIn More