Formal probabilistic analysis of detection properties in wireless sensor networks

DOI10.1007/s00165-014-0304-0zbMath1328.68037OpenAlexW2071975066MaRDI QIDQ903510

Sofiène Tahar, Osman Hasan, Maissa Elleuch, Mohamed Amine Abid

Publication date: 6 January 2016

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-014-0304-0

zbMATH Keywords

schedulingtheorem provingperformance analysiswireless sensor networksdetection probabilitydetection delay

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Formalization of Normal Random Variables in HOL

Uses Software

• PRISM
• ML
• HOL
• Maude
• PMaude

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two and three-dimensional intrusion object detection under randomized scheduling algorithms in sensor networks
• Proofs of randomized algorithms in Coq
• Using theorem proving to verify expectation and variance for discrete random variables
• Three Chapters of Measure Theory in Isabelle/HOL
• Formalization of Entropy Measures in HOL
• Formalization of Continuous Probability Distributions
• Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems
• Coverage and Detection of a Randomized Scheduling Algorithm in Wireless Sensor Networks
• On the Formalization of the Lebesgue Integration Theory in HOL