Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
