Results 1 
2 of
2
A Process Calculus for Mobile Ad Hoc Networks
"... Abstract. We present the ωcalculus, a process calculus for formally modeling and reasoning about Mobile Ad Hoc Wireless Networks (MANETs) and their protocols. The ωcalculus naturally captures essential characteristics of MANETs, including the ability of a MANET node to broadcast a message to any o ..."
Abstract

Cited by 35 (2 self)
 Add to MetaCart
(Show Context)
Abstract. We present the ωcalculus, a process calculus for formally modeling and reasoning about Mobile Ad Hoc Wireless Networks (MANETs) and their protocols. The ωcalculus naturally captures essential characteristics of MANETs, including the ability of a MANET node to broadcast a message to any other node within its physical transmission range (and no others), and to move in and out of the transmission range of other nodes in the network. A key feature of the ωcalculus is the separation of a node’s communication and computational behavior, described by an ωprocess, from the description of its physical transmission range, referred to as an ωprocess interface. Our main technical results are as follows. We give a formal operational semantics of the ωcalculus in terms of labeled transition systems and show that the state reachability problem is decidable for finitecontrol ωprocesses. We also prove that the ωcalculus is a conservative extension of the πcalculus, and that late bisimulation (appropriately lifted from the πcalculus to the ωcalculus) is a congruence. Congruence results are also established for a weak version of late bisimulation, which abstracts away from two types of internal actions: τactions, as in the πcalculus, and µactions, signaling node movement. Finally, we illustrate the practical utility of the calculus by developing and analyzing a formal model of a leaderelection protocol for MANETs. 1
Parameterized Verification of πCalculus Systems ⋆
"... Abstract. In this paper we present an automatic verification technique for parameterized systems where the subsystem behavior is modeled using the πcalculus. At its core, our technique treats each process instance in a system as a property transformer. Given a property ϕ that we want to verify of an ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. In this paper we present an automatic verification technique for parameterized systems where the subsystem behavior is modeled using the πcalculus. At its core, our technique treats each process instance in a system as a property transformer. Given a property ϕ that we want to verify of an Nprocess system, we use a partial model checker to infer the property ϕ ′ (stated as a formula in a sufficiently rich logic) that must hold of an (N − 1)process system. If the sequence of formulas ϕ, ϕ ′,...thus constructed converges, and the limit is satisfied by the deadlocked process, we can conclude that the Nprocess system satisfies ϕ. To this end, we develop a partial model checker for the πcalculus that uses an expressive valuepassing logic as the property language. We also develop a number of optimizations to make the model checker efficient enough for routine use, and a lightweight widening operator to accelerate convergence. We demonstrate the effectiveness of our technique by using it to verify properties of a wide variety of parameterized systems that are beyond the reach of existing techniques. 1