2010
DOI: 10.1007/978-3-642-11623-0_6
View full text |Buy / Rent full text
|
Sign up to set email alerts
|

Abstract: Abstract. 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 an ad hoc network with respect to the underlying topologies. We give a sound and complete axiomatization for the recursion-free part of the term algebra CNT, modulo what we call rooted branching computed network bisimilarity.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
26
0

Year Published

2013
2013
2013
2013

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 21 publications
(26 citation statements)
references
References 13 publications
(16 reference statements)
0
26
0
Order By: Relevance
“…However this connectivity graph is static. In contrast Ghassemi et al [5] have proposed a process algebra called RBPT where topological changes to the connectivity graph are implicitly modelled in the operational semantics rather than in the syntax. Kouzapas and Philippou [11] have developed a theory of confluence for a calculus of dynamic networks and they use their machinery to verify a leader-election algorithm for mobile ad hoc networks.…”
Section: Conclusion and Related Workmentioning
confidence: 99%
“…However this connectivity graph is static. In contrast Ghassemi et al [5] have proposed a process algebra called RBPT where topological changes to the connectivity graph are implicitly modelled in the operational semantics rather than in the syntax. Kouzapas and Philippou [11] have developed a theory of confluence for a calculus of dynamic networks and they use their machinery to verify a leader-election algorithm for mobile ad hoc networks.…”
Section: Conclusion and Related Workmentioning
confidence: 99%
“…R is a branching network bisimulation if R and R −1 are branching network simulations. Two terms t 1 and t 2 are branching network bisimilar, denoted by t 1 b t 2 , if t 1 Rt 2 for some branching network bisimulation relation R. This theorem can be proved in a similar fashion as for branching computed network bisimilarity in [9]. As said, branching network bisimilarity and the equivalence relation induced by CACTL coincide.…”
Section: Branching Network Bisimilaritymentioning
confidence: 82%
“…Lack of support for compositional modeling and arbitrary topology changes has motivated new approaches with a primitive for local broadcast and support of arbitrary mobility. These approaches are CBS#, bKlaim, CWS, CMAN, CMN, ω-calculus, RBPT, CSDT, and AWN [20,21,18,13,17,23,9,14,7]. The common point among them (except RBPT) is implicit manipulation of the underlying topology in the semantics to model arbitrary connectivity changes and mobility.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations