Equational Reasoning on Ad Hoc Networks

Ghassemi, Fatemeh; Fokkink, Wan; Movaghar, Ali

doi:10.1007/978-3-642-11623-0_6

Cited by 21 publications

(26 citation statements)

References 13 publications

(16 reference statements)

Supporting

Mentioning

Contrasting

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%

Modelling MAC-Layer Communications in Wireless Systems

Cerone

Hennessy

Merro

2013

Lecture Notes in Computer Science

View full text Add to dashboard Buy / Rent full text

Abstract. We present a timed broadcast process calculus for wireless networks at the MAC-sublayer where time-dependent communications are exposed to collisions. We define a reduction semantics for our calculus which leads to a contextual equivalence for comparing the external behaviour of wireless networks. Further, we construct an extensional LTS (labelled transition system) which models the activities of stations that can be directly observed by the external environment. Standard bisimulations in this novel LTS provide a sound proof method for proving that two systems are contextually equivalent. In addition, the main contribution of the paper is that our proof technique is also complete for a large class of systems.

show abstract

Section: Conclusion and Related Workmentioning

confidence: 99%

Modelling MAC-Layer Communications in Wireless Systems

Cerone

Hennessy

Merro

2013

Lecture Notes in Computer Science

View full text Add to dashboard Buy / Rent full text

show abstract

“…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%

“…We introduced Restricted Broadcast Process Theory (RBPT) [9] to specify and verify MANETs, taking into account mobility. RBPT specifies a MANET by composing nodes using a restricted local broadcast operator.…”

Section: Introductionmentioning

confidence: 99%

“…We present a model checking algorithm for CACTL; a model checker for CACTL is being implemented, using the rewrite logic Maude. This provides a framework, supporting both equational reasoning [9] and model checking of MANET protocols, to verify topology-dependent properties like "existence of a route".…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Model Checking MANETs with Arbitrary Mobility

Ghassemi

Ahmadi

Fokkink

et al. 2013

Fundamentals of Software Engineering

Self Cite

View full text Add to dashboard Buy / Rent full text

Abstract. Modeling arbitrary connectivity changes of mobile ad hoc networks (MANETs) makes application of automated formal verification challenging. We introduced constrained labeled transition systems (CLTSs) as a semantic model to represent mobility. To model check MANET protocol with respect to the underlying topology and connectivity changes, we here introduce a branching-time temporal logic interpreted over CLTSs. The temporal operators, from Action Computation Tree Logic with an unless operator, are parameterized by multihop constraints over topologies, to express conditions on successful scenarios of a MANET protocol. We moreover provide a bisimilarity relation with the same distinguishing power for CLTSs as our logical framework.

show abstract

Equational Reasoning on Ad Hoc Networks

Cited by 21 publications

References 13 publications

Modelling MAC-Layer Communications in Wireless Systems

Modelling MAC-Layer Communications in Wireless Systems

Model Checking MANETs with Arbitrary Mobility

Contact Info

Product

Resources

About