An observational theory for mobile ad hoc networks (full version)
From MaRDI portal
Publication:1012124
DOI10.1016/j.ic.2007.11.010zbMath1165.68052DBLPjournals/iandc/Merro09OpenAlexW2042562411WikidataQ62041649 ScholiaQ62041649MaRDI QIDQ1012124
Publication date: 14 April 2009
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2007.11.010
Related Items (11)
Mechanizing a process algebra for network protocols ⋮ Modelling and verifying the AODV routing protocol ⋮ Modeling and efficient verification of wireless ad hoc networks ⋮ Depletable channels: dynamics, behaviour, and efficiency in network design ⋮ A semantic theory of the Internet of things ⋮ A timed calculus for wireless systems ⋮ A calculus of trustworthy ad hoc networks ⋮ Modeling and analyzing mobile ad hoc networks in Real-Time Maude ⋮ The Expressive Power of Monotonic Parallel Composition ⋮ Broadcast Psi-calculi with an Application to Wireless Protocols ⋮ Analysis of mobile networks' protocols based on abstract state machine
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A framework for security analysis of mobile wireless networks
- A process calculus for mobile ad hoc networks
- Calculi for synchrony and asynchrony
- Statecharts: a visual formalism for complex systems
- The Esterel synchronous programming language: Design, semantics, implementation
- A calculus of mobile processes. II
- Bisimulations for a calculus of broadcasting systems
- On reduction-based process semantics
- A Calculus for Mobile Ad Hoc Networks
- Barbed bisimulation
- An Observational Theory for Mobile Ad Hoc Networks
- CONCUR 2005 – Concurrency Theory
- Foundations of Software Science and Computation Structures
This page was built for publication: An observational theory for mobile ad hoc networks (full version)
