Abstract

In this paper, we study the complexity metrics of Petri nets. We define some structural complexity metrics, such as volume and cyclomatic number, and dynamic complexity metrics, such as number of node and degree of parallelism in the reachability tree. By empirical study of 75 randomly selected practical Petri nets, we get correlation coefficients among 15 defined metrics and some interesting results. Adapting the maximum firing rule and maximal reduced Petri net, we can reduce the complexity, even though losing some state information, but the maximum firing rule, like the clique problem, is an NP-hard problem. Modeling a maximum concurrency scheduling in concurrent systems by Petri nets, we can make use of the results for predicting the amount of effort needed in modeling and analysis.

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.