A Petri net approach to the evaluation of the complexity of a program
- 1 July 1981
- journal article
- research article
- Published by Taylor & Francis in International Journal of Electronics
- Vol. 51 (1) , 79-85
- https://doi.org/10.1080/00207218108901302
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.Keywords
This publication has 6 references indexed in Scilit:
- On the determination of the solution of a class of Murata's state equation of Petri netsProceedings of the IEEE, 1981
- Optimization of assembly code generation using Petri netsInternational Journal of Electronics, 1980
- Application of Program Graphs and Complexity Analysis to Software Development and TestingIEEE Transactions on Reliability, 1979
- Discrete Systems and FlowchartsIEEE Transactions on Software Engineering, 1978
- State equation, controllability, and maximal matchings of petri netsIEEE Transactions on Automatic Control, 1977
- A Complexity MeasureIEEE Transactions on Software Engineering, 1976