%0 Conference Proceedings
%T Case Study on Certifying Distributed Algorithms: Reducing Intrusiveness
%+ Humboldt-Universität zu Berlin = Humboldt University of Berlin = Université Humboldt de Berlin  (HU Berlin)
%A Akili, Samira
%A Völlinger, Kim
%Z Part 5: Distributed Algorithms
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 8th International Conference on Fundamentals of Software Engineering (FSEN)
%C Tehran, Iran
%Y Hossein Hojjat
%Y Mieke Massink
%I Springer International Publishing
%3 Fundamentals of Software Engineering
%V LNCS-11761
%P 179-185
%8 2019-05-01
%D 2019
%R 10.1007/978-3-030-31517-7_12
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%Z TC 2
%Z WG 2.2
%2 https://inria.hal.science/hal-03769129/document
%2 https://inria.hal.science/hal-03769129/file/490001_1_En_12_Chapter.pdf
%L hal-03769129
%U https://inria.hal.science/hal-03769129
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC2
%~ IFIP-WG2-2
%~ IFIP-FSEN
%~ IFIP-LNCS-11761