Abstract

This paper presents an approach to more efficient partial order reduction for explicit model checking of concurrent systems. This approach utilizes a compositional reachability analysis to generate overapproximate local state transition models for all components in a concurrent system where a dependence relation and other useful information can be extracted. The extracted dependence relation, compared to what can be obtained by statically analyzing the system descriptions, is more precise and refined, and therefore leads to more efficient partial order reduction. This approach is demonstrated on a set of concurrent system examples. Significantly higher reduction in state space has been observed in the majority of the examples compared to what can be obtained with SPIN.

Full Text
Paper version not known

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 call

Disclaimer: 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.