Case Study on Certifying Distributed Algorithms: Reducing Intrusiveness
Case Study on Certifying Distributed Algorithms: Reducing Intrusiveness
复制标题
认证分布式算法案例研究:减少侵入性
DOI:
10.1007/978-3-030-31517-7_12
复制
发表时间:
2019
期刊:
影响因子:
--
通讯作者:
K. Völlinger
中科院分区:
文献类型:
--
作者:
S. Akili;K. Völlinger
Certifying distributed algorithms (CDAs) are a runtime verification method for distributed systems. A CDA computes additionally awitnessto an input-output pair – a correctness argument for the pair. The witness is verified at runtime by a distributedcheckeralgorithm. 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.
登录
查看更多内容
DOI:
10.1007/978-3-319-57288-8_27
发表时间:
2017
期刊:
影响因子:
--
作者:
K. Völlinger;S. Akili
通讯作者:
S. Akili
DOI:
10.1007/978-3-319-67531-2_29
发表时间:
2017
期刊:
影响因子:
--
作者:
K. Völlinger
通讯作者:
K. Völlinger
DOI:
10.1007/978-3-319-92612-4_9
发表时间:
2018
期刊:
影响因子:
--
作者:
K. Völlinger;S. Akili
通讯作者:
S. Akili
DOI:
10.1007/978-3-319-22969-0_14
发表时间:
2015
期刊:
影响因子:
--
作者:
K. Völlinger;W. Reisig
通讯作者:
W. Reisig