A Timed Calculus for Wireless Systems

Merro, Massimo; Sibilio, Eleonora

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

Cited by 24 publications

(5 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Over the recent years, model checking has become a well-known process of validating system's model before its actual implementation. In past decade, research community has proposed several methods to formally verify wireless systems [14] - [16]. Similarly, in existing literature, some attempts are made to formalize the communication protocols in mobile ad-hoc networks [17] - [19].…”

Section: Related Workmentioning

confidence: 99%

Formal verification of mobile agent based anomaly detection in Wireless Sensor Networks

Usman

Muthukkumarasamy

2013

38th Annual IEEE Conference on Local Computer Networks - Workshops

View full text Add to dashboard Buy / Rent full text

Mobile agent technology offers a number of advantages to resource constrained Wireless Sensor Networks (WSNs) by facilitating parallelism, code and data dissemination, localization, and distributed security services. As part of the second line of defense for WSNs, anomaly detection schemes are also benefiting from mobile agent technology. The formal verification can be used to validate the correctness of a system using formal specifications. This study employs Behavior Trees (BTs) for formal verification of mobile agent based anomaly detection system in WSNs. We employed BT based formal semantics to integrate the behavior projection of different components of anomaly detection system. The Symbolic Analysis Laboratory (SAL) tool is used to formally specify the behavior tree model. The analysis based on Linear Temporal Logic (LTL) theorems validates the completeness and consistency of the formal model of mobile agent based anomaly detection system.

show abstract

Section: Related Workmentioning

confidence: 99%

Formal verification of mobile agent based anomaly detection in Wireless Sensor Networks

Usman

Muthukkumarasamy

2013

38th Annual IEEE Conference on Local Computer Networks - Workshops

View full text Add to dashboard Buy / Rent full text

show abstract

“…However, no protocol application or automated analysis is given, and communication delay is not taken into account. Merro et al [27] propose a timed calculus with time-consuming communications, and equip it with a formal semantics to analyze communication collisions. In general, these studies have proposed modeling/analysis frameworks for MANETs, but they lack the expressiveness to model both mobility, bidirectional/unidirectional wireless communication, and/or timing issues.…”

Section: Related Workmentioning

confidence: 99%

“…We abstract from communication collision detection and avoidance, and refer to [27,7] for the formal treatment of communication collisions in wireless networks.…”

Section: Modeling Communication In Mobile Wireless Systemsmentioning

confidence: 99%

“…On the process algebra side, CWS [31], CBS# [32], CMAN [17], CMN [26], the ω-calculus [43], RBPT [15,18], TCWS [27] and AWN [11], have been proposed as process algebraic modeling languages for MANETs. These languages feature a form of local broadcast, in which a message sent by a node could be received by other nodes "within transmission range."…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Modeling and analyzing mobile ad hoc networks in Real-Time Maude

Liu

Ölveczky

Meseguer

2016

Journal of Logical and Algebraic Methods in Programming

View full text Add to dashboard Buy / Rent full text

Modeling and analyzing mobile ad hoc networks (MANETs) pose non-trivial challenges to formal methods. Time, geometry, communication delays and failures, mobility, and uni-and bidirectional wireless communication can interact in unforeseen ways that are hard to model and analyze by current process calculi and automatic formal methods. As a consequence, current analyses tend to abstract away these physical aspects, so thatalthough still quite useful in finding various errors-their simplifying assumptions can easily fail to model details of MANET behavior relevant to meet desired requirements. In this work we present a formal framework for the modeling and analysis of MANETS based on Real-Time Maude to address this challenge. Specifically, we show that our framework has good expressive power to model relevant aspects of MANETs, and good compositionality properties, so that a MANET protocol can be easily composed with various models of mobility and with other MANET protocols. We illustrate the use of our framework on two well-known MANET benchmarks: the AODV routing protocol and the leader election protocol of Vasudevan, Kurose, and Towsley. Our formal analysis has uncovered a spurious behavior in the latter protocol that is due to the subtle interplay between communication delays, node movement, and neighbor discovery. This behavior therefore cannot be found by analyses that abstract from node movement and communication delays.

show abstract

“…Models with a discrete global clock and a lazy exploration of configurations of fixed size has been considered in [12]. Formal specification languages for timed models of ad hoc networks have been proposed, e.g., in [10]. In contrast to these works, we consider computatibility issues for verification of timed ad hoc networks with parametric initial configurations.…”

Section: Introductionmentioning

confidence: 99%

On the Verification of Timed Ad Hoc Networks

Abdulla

Delzanno²,

Rezine

et al. 2011

Lecture Notes in Computer Science

View full text Add to dashboard Buy / Rent full text

Abstract. We study decidability and undecidability results for parameterized verification of a formal model of timed Ad Hoc network protocols. The communication topology is represented by a graph and the behavior of each node is represented by a timed automaton communicating with its neighbors via broadcast messages. We consider verification problems formulated in terms of reachability, starting from initial configurations of arbitrary size, of a configuration that contain at least one occurrence of a node in a certain state. We study the problem for dense and discrete time and compare the results with those obtained for (fully connected) networks of timed automata.

show abstract

A Timed Calculus for Wireless Systems

Cited by 24 publications

References 22 publications

Formal verification of mobile agent based anomaly detection in Wireless Sensor Networks

Formal verification of mobile agent based anomaly detection in Wireless Sensor Networks

Modeling and analyzing mobile ad hoc networks in Real-Time Maude

On the Verification of Timed Ad Hoc Networks

Contact Info

Product

Resources

About