Probabilistic Model Checking of the IEEE 802.11 Wireless Local Area Network Protocol

Kwiatkowska, Marta; Norman, Gethin; Sproston, Jeremy

doi:10.1007/3-540-45605-8_11

Cited by 99 publications

(82 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…This approach requires that the comparisons involving clocks in guards and invariants are non-strict; however, this is a common property in PTA models of real-life systems, such as the CSMA/CD protocol considered in this chapter. The digital-clocks approach has been, to date, the most successful in practice of the finite-state representations proposed for PTAs: it has been used to verify the CSMA/CD protocol [10,28], part of the IEEE 802.11 standard for wireless local area networks [26,31], the FireWire root contention protocol [27], and the IPv4 Zeroconf protocol [23].…”

Section: Outlinementioning

confidence: 99%

Practical Applications of Probabilistic Model Checking to Communication Protocols

Duflot

Kwiatkowska

Norman

et al. 2012

Formal Methods for Industrial Critical Systems

Self Cite

View full text Add to dashboard Cite

Section: Outlinementioning

confidence: 99%

Practical Applications of Probabilistic Model Checking to Communication Protocols

Duflot

Kwiatkowska

Norman

et al. 2012

Formal Methods for Industrial Critical Systems

Self Cite

View full text Add to dashboard Cite

“…Many aspects of their design would therefore benefit from the use of model checking techniques. Hitherto, the use of model checking in this domain has been largely restricted to the quantitative evaluation of WSN protocols [4,15,18].…”

Section: Model Checkingmentioning

confidence: 99%

Towards Verifying Correctness of Wireless Sensor Network Applications Using Insense and Spin

Sharma

Lewis

Miller

et al. 2009

Model Checking Software

View full text Add to dashboard Cite

Abstract. The design and implementation of wireless sensor network applications often require domain experts, who may lack expertise in software engineering, to produce resource-constrained, concurrent, real-time software without the support of high-level software engineering facilities. The Insense language aims to address this mismatch by allowing the complexities of synchronisation, memory management and event-driven programming to be borne by the language implementation rather than by the programmer. The main contribution of this paper is an initial step towards verifying the correctness of WSN applications with a focus on concurrency. We model part of the synchronisation mechanism of the Insense language implementation using Promela constructs and verify its correctness using SPIN. We demonstrate how a previously published version of the mechanism is shown to be incorrect by SPIN, and give complete verification results for the revised mechanism.

show abstract

“…The efficient algorithm for calculating bounds on the maximal reachability probability of probabilistic real-time automata presented in [56] has subsequently been implemented in [19]. For case studies concerning the qualitative verification of real-time randomized distributed algorithms protocols see [19,59,58].…”

Section: Verifying Complex Parameterized and Infinite-state Protocolsmentioning

confidence: 99%

Analysing Randomized Distributed Algorithms

Norman

2004

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Randomization is of paramount importance in practical applications and randomized algorithms are used widely, for example in co-ordinating distributed computer networks, message routing and cache management. The appeal of randomized algorithms is their simplicity and elegance. However, this comes at a cost: the analysis of such systems become very complex, particularly in the context of distributed computation. This arises through the interplay between probability and nondeterminism. To prove a randomized distributed algorithm correct one usually involves two levels: classical, assertion-based reasoning, and a probabilistic analysis based on a suitable probability space on computations. In this paper we describe a number of approaches which allows us to verify the correctness of randomized distributed algorithms.

show abstract

Probabilistic Model Checking of the IEEE 802.11 Wireless Local Area Network Protocol

Cited by 99 publications

References 20 publications

Practical Applications of Probabilistic Model Checking to Communication Protocols

Practical Applications of Probabilistic Model Checking to Communication Protocols

Towards Verifying Correctness of Wireless Sensor Network Applications Using Insense and Spin

Analysing Randomized Distributed Algorithms

Contact Info

Product

Resources

About