分布式周界监视系统(DPSS)算法A有界收敛时间的机械化证明
A Mechanized Proof of Bounded Convergence Time for the Distributed Perimeter Surveillance System (DPSS) Algorithm A
摘要:
分散式周界监视系统(DPSS)寻求提供用于跨无人驾驶飞行器(UAV)的集合随时间均匀地分布周界的监视的分散式协议,所述无人驾驶飞行器的集合的成员仅在彼此紧密接近时才可以通信。该协议还必须收敛到一个均匀分布的周长在有限的时间。两个版本的DPSS协议在原来的文件似乎收敛于有界时间,但只有非正式的证明和参数。后来对这些协议应用模型检验,发现其中一个关键引理中有错误,使一个引理的非正式证明无效,并对另一个引理产生怀疑。因此,Jeremy Avigad和Floris van Doorn开发了DPSS协议或算法的简单版本(算法A或DPSS-A)的收敛时间的新手动证明。本文描述了一种机械化的手证明的逻辑ACL 2,并讨论了三个具体的ACL 2实用程序,证明有用的DPSS模型的表达和推理。
英文摘要:
The decentralized perimeter surveillance system (DPSS) seeks to provide a decentralized protocol for evenly distributing surveillance of a perimeter over time across an ensemble of unmanned aerial vehicles (UAVs) whose members may communicate only when in close proximity to each other. The protocol must also converge to an even distribution of the perimeter in bounded time. Two versions of the DPSS protocol presented in the original paper seem to converge in bounded time but only informal proofs and arguments are given. A later application of model checking to these protocols found an error in one of the key lemmas, invalidating the informal proof for one and casting doubt on the other. Therefore, a new hand proof of the convergence time for the simpler version of the DPSS protocol or algorithm, Algorithm A or DPSS-A, was developed by Jeremy Avigad and Floris van Doorn. This paper describes a mechanization of that hand proof in the logic of ACL2 and discusses three specific ACL2 utilities that proved useful for expressing and reasoning about the DPSS model.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。