A Minimum Cycle Time Analysis for Hierarchical Petri

Abstract

Petri net minimum-cycle-time analysis methods have been widely used in system design in order to verify user requirements in the early design stages of software development. The minimum-cycle-time analysis process builds a Petri net model of the design, finds the minimum positive T-invariant and all of the independent minimal support S-invariants S, calculates the resource-time product, for each s an element of S calculates the product of S-invariant and the resource-time product, and returns the maximum of these products. If a computer system is complex, its Petri net model contains so many transitions and places that a full comprehension of the model becomes extremely difficult. In order to address this problem, hierarchical Petri nets have been developed. However, all of the existing hierarchical Petri net methods have only dealt with liveness, boundedness, reversibility, and other similar things. None of these methods addresses the minimum cycle time. This paper introduces a Minimum-Cycle-Time analysis process for Hierarchical Petri nets (MCTH).