A calculus of trustworthy ad hoc networks
From MaRDI portal
Publication:470043
DOI10.1007/s00165-011-0210-7zbMath1298.68041WikidataQ62041620 ScholiaQ62041620MaRDI QIDQ470043
Eleonora Sibilio, Massimo Merro
Publication date: 11 November 2014
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00165-011-0210-7
mobile ad hoc network; non-interference; process calculus; trust management system; trust-based routing
68M10: Network design and communication in computer systems
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68M14: Distributed systems
Related Items
Formal Analysis of Leader Election in MANETs Using Real-Time Maude, Modeling and analyzing mobile ad hoc networks in Real-Time Maude, A semantic theory of the Internet of things, Depletable channels: dynamics, behaviour, and efficiency in network design
Uses Software
Cites Work
- A framework for security analysis of mobile wireless networks
- An operational semantics for a calculus for wireless systems
- A process calculus for mobile ad hoc networks
- An observational theory for mobile ad hoc networks (full version)
- A calculus of mobile processes. I
- Noninterference for concurrent programs and thread systems
- Static analysis for the \(\pi\)-calculus with applications to security
- Controlling information release in the \(\pi\)-calculus
- Probabilistic Mobility Models for Mobile and Wireless Networks
- Equational Reasoning on Ad Hoc Networks
- Formal verification of standards for distance vector routing protocols
- A Calculus for Mobile Ad Hoc Networks
- An Axiomatic Approach to Information Flow in Programs
- Barbed bisimulation
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Unnamed Item
- Unnamed Item
- Unnamed Item
