Formalising Sensor Topologies for Target Counting

Linker, S. and Sevegnani, M. (2018) Formalising Sensor Topologies for Target Counting. In: 1st Workshop on Architectures, Languages and Paradigms for IoT, Turin, Italy, 18 Sept 2017, pp. 43-57. (doi: 10.4204/EPTCS.264.5)

145164.pdf - Published Version
Available under License Creative Commons Attribution.



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.

Item Type:Conference Proceedings
Glasgow Author(s) Enlighten ID:Sevegnani, Dr Michele
Authors: Linker, S., and Sevegnani, M.
College/School:College of Science and Engineering > School of Computing Science
Copyright Holders:Copyright © 2018 S. Linker and M. Seveganani
First Published:First published in 1st Workshop on Architectures, Languages and Paradigms for IoT: 43-57
Publisher Policy:Reproduced under a Creative Commons License
Related URLs:

University Staff: Request a correction | Enlighten Editors: Update this record

Project CodeAward NoProject NamePrincipal InvestigatorFunder's NameFunder RefLead Dept
679481Science of sensor systems software (SSSS)Muffy CalderEngineering and Physical Sciences Research Council (EPSRC)EP/N007565/1COM - COMPUTING SCIENCE