A process calculus for mobile ad hoc networks
DOI10.1016/J.SCICO.2009.07.008zbMATH Open1192.68451OpenAlexW1990328104MaRDI QIDQ967528FDOQ967528
Authors: Anu Singh, C. R. Ramakrishnan, Scott A. Smolka 
Publication date: 29 April 2010
Published in: Science of Computer Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.scico.2009.07.008
Recommendations
Network design and communication in computer systems (68M10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A calculus of mobile processes. II
- On the decidability of process equivalences for the \(\pi\)-calculus
- Towards a calculus for wireless systems
- A Calculus for Mobile Ad Hoc Networks
- A framework for security analysis of mobile wireless networks
- On the bisimulation proof method
- An introduction to the \(\pi\)-calculus.
- Mobile ambients
- Title not available (Why is that?)
- Parametric synchronizations in mobile nominal calculi
- An Observational Theory for Mobile Ad Hoc Networks
- Tools and Algorithms for the Construction and Analysis of Systems
Cited In (30)
- Verification of correspondence assertions in a calculus for mobile ad hoc networks
- Applying Formal Methods: Testing, Performance, and M/E-Commerce
- Measuring security in IoT communications
- Analysis of mobile networks' protocols based on abstract state machine
- Denotational and algebraic semantics for the CaIT calculus
- Mechanizing a process algebra for network protocols
- Reliable restricted process theory
- Equational reasonings in wireless network gossip protocols
- Modeling and analyzing mobile ad hoc networks in Real-Time Maude
- Modelling probabilistic wireless networks
- An observational theory for mobile ad hoc networks (full version)
- Broadcast psi-calculi with an application to wireless protocols
- A calculus for mobile ad-hoc networks with static location binding
- Modelling and verifying the AODV routing protocol
- A calculus of trustworthy ad hoc networks
- Proofs about Network Communication: For Humans and Machines
- A process algebra for wireless mesh networks
- Formal analysis of leader election in MANETs using Real-Time Maude
- Title not available (Why is that?)
- Modeling and efficient verification of wireless ad hoc networks
- Characterising testing preorders for broadcasting distributed systems
- UTP semantics of a calculus for mobile ad hoc networks
- A calculus for power-aware multicast communications in ad hoc networks
- A timed process algebra for wireless networks with an application in routing (extended abstract)
- A formal approach to the engineering of domain-specific distributed systems
- A semantic theory of the Internet of Things
- Model checking mobile ad hoc networks
- Depletable channels: dynamics, behaviour, and efficiency in network design
- A Calculus for Mobile Ad Hoc Networks
- Probabilistic mobility models for mobile and wireless networks
Uses Software
This page was built for publication: A process calculus for mobile ad hoc networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q967528)
