Verification of mobile ad hoc networks: an algebraic approach
DOI10.1016/j.tcs.2011.03.017zbMath1216.68160OpenAlexW1976627080WikidataQ57835298 ScholiaQ57835298MaRDI QIDQ549194
W. J. Fokkink, Fatemeh Ghassemi, Ali Movaghar
Publication date: 7 July 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.03.017
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical problems of computer architecture (68M07) Network protocols (68M12)
Related Items (5)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Verification of mobile ad hoc networks: an algebraic approach
- Cones and foci: A mechanical framework for protocol verification
- Focus points and convergent process operators: A proof strategy for protocol verification
- Efficient on-the-fly model-checking for regular alternation-free \(\mu\)-calculus
- Modelling distributed systems.
- Equational Reasoning on Mobile Ad Hoc Networks
- Equational Reasoning on Ad Hoc Networks
- Formal verification of standards for distance vector routing protocols
- Process algebra for synchronous communication
- A Calculus for Mobile Ad-hoc Networks with Static Location Binding
- Formal Techniques for Networked and Distributed Systems – FORTE 2004
- The parallel composition of uniform processes with data
This page was built for publication: Verification of mobile ad hoc networks: an algebraic approach