A process calculus for mobile ad hoc networks

DOI10.1016/J.SCICO.2009.07.008MaRDI QIDQ967528zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

congruencebisimulationmobile ad hoc networksprocess calculi

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• A Calculus for Mobile Ad Hoc Networks
• An observational theory for mobile ad hoc networks (full version)
• A calculus for mobile ad-hoc networks with static location binding
• A calculus of trustworthy ad hoc networks
• An Observational Theory for Mobile Ad Hoc Networks

Cites work

• scientific article; zbMATH DE number 1231689 (Why is no real title available?)
• scientific article; zbMATH DE number 1953026 (Why is no real title available?)
• scientific article; zbMATH DE number 1956590 (Why is no real title available?)
• A Calculus for Mobile Ad Hoc Networks
• A calculus of mobile processes. II
• A framework for security analysis of mobile wireless networks
• An Observational Theory for Mobile Ad Hoc Networks
• An introduction to the \(\pi\)-calculus.
• Mobile ambients
• On the bisimulation proof method
• On the decidability of process equivalences for the \(\pi\)-calculus
• Parametric synchronizations in mobile nominal calculi
• Tools and Algorithms for the Construction and Analysis of Systems
• Towards a calculus for wireless systems

Cited in

(30)

• A calculus of trustworthy ad hoc networks
• Measuring security in IoT communications
• Verification of correspondence assertions in a calculus for mobile ad hoc networks
• Equational reasonings in wireless network gossip protocols
• Broadcast psi-calculi with an application to wireless protocols
• Analysis of mobile networks' protocols based on abstract state machine
• Mechanizing a process algebra for network protocols
• An observational theory for mobile ad hoc networks (full version)
• A process algebra for wireless mesh networks
• 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
• UTP semantics of a calculus for mobile ad hoc networks
• Applying Formal Methods: Testing, Performance, and M/E-Commerce
• A calculus for mobile ad-hoc networks with static location binding
• A formal approach to the engineering of domain-specific distributed systems
• Modeling and analyzing mobile ad hoc networks in Real-Time Maude
• Proofs about Network Communication: For Humans and Machines
• Characterising testing preorders for broadcasting distributed systems
• Probabilistic mobility models for mobile and wireless networks
• Modelling and verifying the AODV routing protocol
• Reliable restricted process theory
• A calculus for power-aware multicast communications in ad hoc networks
• Modeling and efficient verification of wireless ad hoc networks
• Denotational and algebraic semantics for the CaIT calculus
• A timed process algebra for wireless networks with an application in routing (extended abstract)
• Modelling probabilistic wireless networks
• Formal analysis of leader election in MANETs using Real-Time Maude
• scientific article; zbMATH DE number 1949603 (Why is no real title available?)

Describes a project that uses

Uses Software

• HOL/SPIN
• SPIN
• Uppaal
• MMC

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)