A calculus of mobile processes, I
Information and Computation
A calculus of broadcasting systems
ESOP '94 Selected papers of ESOP '94, the 5th European symposium on Programming
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Communication and Concurrency
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
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
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)
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 process calculus for dynamic networks
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
A timed calculus for wireless systems
Theoretical Computer Science
A timed calculus for wireless systems
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
| Hi-index | 0.00 |
We present a process calculus for mobile ad hoc networks which is a natural continuation of our earlier work on the process calculus CMAN [J.C. Godskesen. A calculus for mobile ad hoc networks. In Proceedings of the 9th International Conference, COORDINATION 2007, volume 4467 of LNCS, pages 132-150, Paphos, Cyprus, June 2007. Springer-Verlag]. 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 contextual bisimulation equivalence to be a sound and complete co-inductive characterization of the reduction congruence. The two changes to the calculus in [J.C. Godskesen. A calculus for mobile ad hoc networks. In Proceedings of the 9th International Conference, COORDINATION 2007, volume 4467 of LNCS, pages 132-150, Paphos, Cyprus, June 2007. Springer-Verlag] yields a much simpler bisimulation semantics, and importantly and in contrast to [J.C. Godskesen. A calculus for mobile ad hoc networks. In Proceedings of the 9th International Conference, COORDINATION 2007, volume 4467 of LNCS, pages 132-150, Paphos, Cyprus, June 2007. Springer-Verlag] we manage to provide a non-contextual weak bisimulation congruence facilitating ease of proofs and being strictly contained in the contextual bisimulation.