A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
We present a process calculus for mobile ad hoc networks which is a natural continuation of our earlier work on the process calculus CMAN . Essential to the new calculus is the novel restricted treatment of node mobility imposed by hiding of location names using a static binding operator, and we introduce the more general notion of unidirectional links instead of bidirectional links. We define a natural weak reduction semantics and a reduction congruence and prove our weak contextualdoi:10.1016/j.entcs.2009.06.018 fatcat:sl2xt4fwinfzzougn5lbsoymsi