A calculus of mobile processes, II
Information and Computation
A calculus of broadcasting systems
ESOP '94 Selected papers of ESOP '94, the 5th European symposium on Programming
On the decidability of process equivalences for the &pgr;-calculus
Theoretical Computer Science - Special issue on algebraic methodology and software technology
Towards a primitive higher order calculus of broadcasting systems
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
A Broadcast-based Calculus for Communicating Systems
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Efficient Model Checking Using Tabled Resolution
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
On the bisimulation proof method
Mathematical Structures in Computer Science
A logical encoding of the π-calculus: model checking mobile processes using tabled resolution
International Journal on Software Tools for Technology Transfer (STTT)
Design and Analysis of a Leader Election Algorithm for Mobile Ad Hoc Networks
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
A framework for security analysis of mobile wireless networks
Theoretical Computer Science - Automated reasoning for security protocol analysis
An Observational Theory for Mobile Ad Hoc Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
Parametric synchronizations in mobile nominal calculi
Theoretical Computer Science
Towards a Calculus For Wireless Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
A calculus for mobile ad hoc networks
COORDINATION'07 Proceedings of the 9th international conference on Coordination models and languages
A provably correct compiler for efficient model checking of mobile processes
PADL'05 Proceedings of the 7th international conference on Practical Aspects of Declarative Languages
Parameterized verification of π-calculus systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Towards an algebra of routing tables
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Broadcast psi-calculi with an application to wireless protocols
SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods
A process algebra for wireless mesh networks
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
A semantic analysis of wireless network security protocols
NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
Linda in space-time: an adaptive coordination model for mobile ad-hoc environments
COORDINATION'12 Proceedings of the 14th international conference on Coordination Models and Languages
Proceeings of the 2nd International Workshop on Worst-Case Traversal Time
Formal verification of real-time wireless sensor networks protocols with realistic radio links
Proceedings of the 21st International conference on Real-Time Networks and Systems
| Hi-index | 0.00 |
We present the @w-calculus, a process calculus for formally modeling and reasoning about Mobile Ad Hoc Wireless Networks (MANETs) and their protocols. The @w-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 @w-calculus is the separation of a node's communication and computational behavior, described by an @w-process, from the description of its physical transmission range, referred to as an @w-process interface. Our main technical results are as follows. We give a formal operational semantics of the @w-calculus in terms of labeled transition systems and show that the state reachability problem is decidable for finite-control @w-processes. We also prove that the @w-calculus is a conservative extension of the @p-calculus, and that late bisimulation equivalence (appropriately lifted from the @p-calculus to the @w-calculus) is a congruence. Congruence results are also established for a weak version of late bisimulation equivalence, which abstracts away from two types of internal actions: @t-actions, as in the @p-calculus, and @m-actions, signaling node movement. We additionally define a symbolic semantics for the @w-calculus extended with the mismatch operator, along with a corresponding notion of symbolic bisimulation equivalence, and establish congruence results for this extension as well. Finally, we illustrate the practical utility of the calculus by developing and analyzing formal models of a leader election protocol for MANETs and the AODV routing protocol.