A formalism for critical path analysis of real-time Ada programs

A formalism for critical path analysis of real-time programs is introduced. This formalism is geared towards the analysis of Ada programs, but can be used for other concurrent programming languages, such as concurrent C, PL/1, or even to system specification languages. Ada systems, which are Petri net models of real-time Ada programs, are defined, then an algorithm for computing the critical path is presented. The net models introduced differ from the ones used by T. Murata (1989) because the time required by different activities in a real-time system must be accounted for. The ultimate goal is to reduce a given Ada system to a canonical form which consists of two places and one transition with a cost equal to the cost of the critical-path.<
>