Probabilistic Model Checking of the CSMA/CD Protocol Using PRISM and APMC

Practical Applications of Probabilistic Model Checking to Communication Protocols

“…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].…”

“…In [10], time is discretized (using the digital clocks approach, mentioned in Section 7.3) and the resulting model is analysed using PRISM [18,29] and APMC [17,3]. In [28] the probabilistic timed automaton model is analysed using a probabilistic extension of the model checking approach for classical timed automata [16], implemented in a prototype extension of PRISM.…”

“…The model of the CSMA/CD protocol used here is a combination of the models from [38,10,28] and considers the case of two stations. The PTA comprises three components operating in parallel, representing the two stations and the bus.…”

“…The first accurate formal analysis with respect to the probabilistic aspects of the protocol was undertaken in [10] and [28], where the system was modelled by a probabilistic timed automaton and the correctness of the probabilistic behaviour of the protocol verified by analysing minimum and maximum probabilities for reachability and time-bounded reachability properties.…”

Uncertainty analysis of phased mission systems with probabilistic timed automata

“…PTAs have been used to verify a variety of protocols, e.g. the CSMA/CD back-off protocol [25], the FireWire root contention protocol [26], and the IPv4 Zeroconf protocol [22].…”