In: 1988; Proceedings of the 2nd International Seminar, 1988, Wendisch-Rietz, DDR; Part 3: Informatik Informationen, Reporte, Nr. 17, pages 72-83. Akademie der Wissenschaften der DDR, Institut für Informatik und Rechentechnik, 1988.
Abstract: The approach to measure the complexity of a given program by means of the amount of its acyclic execution paths is applied to Modula-2. To motivate the method, the program control flow is modelled by Petri nets. The introduced complexity measure for a set of distributed processes yields a lower and upper bound of the size of the corresponding reachability graph under maximum fire rule. The computation of the complexity measure is described recursively in a grammar-oriented manner.
Keywords: complexity (of) distributed program; reachability graph; Modula-2.