Progress, Justness, and Fairness Page 1 69 Progress, Justness, and Fairness ROB VAN
GLABBEEK and PETER HÖFNER, Data61, CSIRO and UNSW, Australia Fairness assumptions …

The proposed method provides this support by a combination of its abstraction concept and
its operational character: models come as behavioral models in the precise and simple form …

Wireless sensor networks are limited by the vast majority of goods with limited resources.
Power consumption, network longevity, throughput, routing, and network security are only a …

We propose a process algebra for wireless mesh networks that combines novel treatments
of local broadcast, conditional unicast and data structures. In this framework, we model the …

This paper describes an automated, formal and rigorous analysis of the Ad hoc On-Demand
Distance Vector (AODV) routing protocol, a popular protocol used in wireless mesh …

This paper presents a formal specification of the Ad hoc On-demand Distance Vector
(AODV) routing protocol using AWN (Algebra for Wireless Networks), a recent process …

Wireless mesh networks (WMNs) consist of static nodes that usually have one or more
radios or media. Optimal channel assignment (CA) for nodes is a challenging problem in …

Modeling and analyzing mobile ad hoc networks (MANETs) pose non-trivial challenges to
formal methods. Time, geometry, communication delays and failures, mobility, and uni-and …

In 1987 Ernst-Rüdiger Olderog provided an operational Petri net semantics for a subset of
CCSP, the union of Milner's CCS and Hoare's CSP. It assigns to each process term in the …

In the area of mobile ad-hoc networks and wireless mesh networks, sequence numbers are
often used in routing protocols to avoid routing loops. It is commonly stated in protocol …