Heuristic-Guided Verification for Fast Congestion Detection on Wireless Sensor Networks

摘要

Petri Net (PN) are widely used to model distributed systems due to its powerful capability of simulating stepwise behaviors of the systems in both sequential or concurrent manners. Furthermore, PN models can be formally verified of their properties using model checking. However, when applied in practical situations, this approach suffers from the infamous problem of state space explosion. In this paper, we suggest a heuristic approach which can potentially reduce the resource consumed by the verification process on a PN-modeled system. We illustrate our idea by an application of congestion detection of Wireless Sensor Networks (WSN), once represented as PN models. The experimental results confirm the improvements gained by our approach.