State space reduction for sensor networks using two-level partial order reduction

• Main Authors: ZHENG, Manchun, SANÁN, David, SUN, Jun, LIU, Yang, DONG, Jin Song, GU, Yu
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2013
• Subjects: Sensor Network; Wireless Sensor Network; Model Chec; Linear Temporal Logic; Task Sequence; Software Engineering
• Online Access: https://ink.library.smu.edu.sg/sis_research/5011; https://ink.library.smu.edu.sg/context/sis_research/article/6014/viewcontent/state_space.pdf
• Institution: Singapore Management University

Wireless sensor networks may be used to conduct critical tasks like fire detection or surveillance monitoring. It is thus important to guarantee the correctness of such systems by systematically analyzing their behaviors. Formal verification of wireless sensor networks is an extremely challenging task as the state space of sensor networks is huge, e.g., due to interleaving of sensors and intra-sensor interrupts. In this work, we develop a method to reduce the state space significantly so that state space exploration methods can be applied to a much smaller state space without missing a counterexample. Our method explores the nature of networked NesC programs and uses a novel two-level partial order reduction approach to reduce interleaving among sensors and intra-sensor interrupts. We define systematic rules for identifying dependence at sensor and network levels so that partial order reduction can be applied effectively. We have proved the soundness of the proposed reduction technique, and present experimental results to demonstrate the effectiveness of our approach.