Formal probabilistic analysis of detection properties in wireless sensor networks
type: Item
instance of: scholarly article
title: Formal probabilistic analysis of detection properties in wireless sensor networks
zbMATH Open document ID: 1328.68037
author: Maissa Elleuch
author: Osman Hasan
author: Sofiène Tahar
author: Mohamed Amine Abid
published in: Formal Aspects of Computing
publication date: 2016-01-06T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68T15
zbMATH DE Number: 6526770
zbMATH Keywords: theorem proving
zbMATH Keywords: wireless sensor networks
zbMATH Keywords: scheduling
zbMATH Keywords: performance analysis
zbMATH Keywords: detection probability
zbMATH Keywords: detection delay
describes a project that uses: PRISM
describes a project that uses: ML
describes a project that uses: HOL
describes a project that uses: PMaude
describes a project that uses: Maude
MaRDI profile type: Publication
full work available at URL: s00165-014-0304-0
OpenAlex ID: W2071975066
cites work: Using theorem proving to verify expectation and variance for discrete random variables
cites work: Proofs of randomized algorithms in Coq
cites work: Q5538132
cites work: Q5287513
cites work: Three Chapters of Measure Theory in Isabelle/HOL
cites work: Formalization of Continuous Probability Distributions
cites work: Q4484343
cites work: Q4217794
cites work: On the Formalization of the Lebesgue Integration Theory in HOL
cites work: Formalization of Entropy Measures in HOL
cites work: Q4738778
cites work: Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems
cites work: Coverage and Detection of a Randomized Scheduling Algorithm in Wireless Sensor Networks
cites work: Two and three-dimensional intrusion object detection under randomized scheduling algorithms in sensor networks
DOI: 10.1007/S00165-014-0304-0
description: scientific article; zbMATH DE number 6526770