Real-time behaviour of asynchronous agents
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Theoretical Computer Science
Symbolic model checking for real-time systems
Information and Computation
Formal methods: state of the art and future directions
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Algorithm 457: finding all cliques of an undirected graph
Communications of the ACM
Communication and Concurrency
A brief history of process algebra
Theoretical Computer Science - Process algebra
Worst-case lifetime computation of a wireless sensor network by model-checking
Proceedings of the 4th ACM workshop on Performance evaluation of wireless ad hoc, sensor,and ubiquitous networks
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
Model-based validation of QoS properties of biomedical sensor networks
EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
A process calculus for Mobile Ad Hoc Networks
Science of Computer Programming
Modelling and verification of the LMAC protocol for wireless sensor networks
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Formal modeling and analysis of wireless sensor network algorithms in real-time maude
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Quality-Driven Volcanic Earthquake Detection Using Wireless Sensor Networks
RTSS '10 Proceedings of the 2010 31st IEEE Real-Time Systems Symposium
A formal analysis of the web services atomic transaction protocol with UPPAAL
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Comparison of the expressiveness of timed automata and time petri nets
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Romeo: a tool for analyzing time petri nets
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Formal verification of real-time wireless sensor networks protocols with realistic radio links
Proceedings of the 21st International conference on Real-Time Networks and Systems
Hi-index | 0.00 |
Wireless Sensor Networks (WSNs) are usually deployed in order to monitor parameters of an area. When an event occurs in the network an alarm is sent to a special node called the sink. In critical real-time applications, when an event is detected, the Worst Case Traversal Time (WCTT) of the message must be bounded. Although real-time protocols for WSNs have been proposed, they are rarely formally verified. The model checking of WSNs is a challenging problem for several reasons. First, WSNs are usually large scale so it induces state space explosion during the verification. Moreover, wireless communications produce a local broadcast behavior which means that a packet is received only by nodes which are in the radio range of the sender. Finally, the radio link is probabilistic. The modeling of those aspects of the wireless link is not straightforward and it has to be done in a way that mitigate the state space explosion problem. In this paper we particularly focus on the modeling of the local broadcast behavior with Timed Automata (TA). We use TA because they have sufficient expressiveness and analysis power in order to check time properties of protocols, as shown in the paper. Three ways of modeling local broadcast with synchronizations of TA are presented. We compare them and show that they produce different state space sizes and execution times during the model checking process. We run several model checking on a simple WSN protocol and we conclude that one model mitigate the state explosion problem better than the others. In the future, the next step will be to enhance this model with the probabilistic aspect of radio communications and to show it remains the best one.