Abstract
The complexity evaluation of a program utilizing the reachability concept of a Petri net (PN) is proposed. A PN representation of a particular program is also given. Three measures of complexity namely (i) cyclomatic number (ii) number of simple paths and (iii) execution time are discussed. Unlike other methods for the determination of number of paths as a complexity measure, the proponed technique does not require matrix multiplication. Only vector additions on the columns of a single matrix is needed. This alleviates the computational effort, and it is simple and easily computerized.
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.
