2018/02/06 by Sven Linker, Michele Sevegnani
Computer Science · #cs.LO
paper · pdf · doi:10.4204/eptcs.264.5
published as EPTCS 264, 2018, pp. 43-57 · In Proceedings ALP4IoT 2017, arXiv:1802.00976
arxiv created 2018/02/06 · arxiv updated 2018/02/07
We present a formal model developed to reason about topologies created by sensor ranges. This model is used to formalise the topological aspects of an existing counting algorithm to estimate the number of targets in the area covered by the sensors. To that end, we present a first-order logic tailored to specify relations between parts of the space with respect to sensor coverage. The logic serves as a specification language for Hoare-style proofs of correctness of the topological computations of the algorithm, which uncovers ambiguities in their results. Subsequently, we extend the formal model as a step towards improving the estimation of the algorithm. Finally, we sketch how the model can be extended to take mobile sensors and temporal aspects into account.