Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Logic in Computer Science

arXiv:1802.01791v1 (cs)
[Submitted on 6 Feb 2018]

Title:Formalising Sensor Topologies for Target Counting

Authors:Sven Linker (1), Michele Sevegnani (2) ((1) University of Liverpool, (2) University of Glasgow)
View PDF
Abstract: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.
Comments: In Proceedings ALP4IoT 2017, arXiv:1802.00976
Subjects: Logic in Computer Science (cs.LO)
Cite as: arXiv:1802.01791 [cs.LO]
  (or arXiv:1802.01791v1 [cs.LO] for this version)
  https://doi.org/10.48550/arXiv.1802.01791
Journal reference: EPTCS 264, 2018, pp. 43-57
Related DOI: https://doi.org/10.4204/EPTCS.264.5

Submission history

From: EPTCS [view email] [via EPTCS proxy]
[v1] Tue, 6 Feb 2018 04:10:29 UTC (29 KB)
Full-text links:

Access Paper:

view license
Current browse context:
cs.LO
< prev   |   next >
new | recent | 2018-02
Change to browse by:
cs

References & Citations

DBLP - CS Bibliography

listing | bibtex
Sven Linker
Michele Sevegnani
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)