Loading...

Model checking MANETs with arbitrary mobility

Ghassemi, F ; Sharif University of Technology | 2013

724 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/978-3-642-40213-5_14
  3. Publisher: Springer Verlag , 2013
  4. Abstract:
  5. 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 multi-hop 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
  6. Keywords:
  7. Distributed computer systems ; Mobile ad hoc networks ; Model checking ; Semantics ; Topology ; Automated formal verification ; Computation tree logic ; Labeled transition systems ; Logical frameworks ; MANET protocols ; Mobile adhoc network (MANETs) ; Semantic Model ; Temporal operators ; Software engineering
  8. Source: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) ; Volume 8161 LNCS , April , 2013 , Pages 217-232 ; 03029743 (ISSN) ; 9783642402128 (ISBN)
  9. URL: http://link.springer.com/chapter/10.1007%2F978-3-642-40213-5_14