Equational Reasoning on Mobile Ad Hoc Networks
Copyright policy )Equational Reasoning on Mobile Ad Hoc Networks
We provide an equational theory for Restricted Broadcast Process Theory to reason about ad hoc networks. We exploit an extended algebra called Computed Network Theory to axiomatize restricted broadcast. It allows one to define the behavior of an ad hoc network with respect to the underlying topologies. We give a sound and ground-complete axiomatization for CNT terms with finite-state behavior, modulo what we call rooted branching computed network bisimilarity.
- Vrije Universiteit Amsterdam Netherlands
- Sharif University of Technology Iran (Islamic Republic of)
Network design and communication in computer systems, Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.), ad hoc networks, axiomatization, restricted broadcast process theory
Network design and communication in computer systems, Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.), ad hoc networks, axiomatization, restricted broadcast process theory
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).6 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!