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

Author

Marinescu, Dan C. ; Stansifer, Ryan

Author_Institution

Dept. of Comput. Sci., Purdue Univ., West Lafayette, IN, USA

fYear

1989

fDate

14-16 Aug 1989

Firstpage

144

Abstract

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

Keywords

Ada; C language; PL/1; Petri nets; critical path analysis; multiprocessing programs; program verification; PL/1; Petri net models; canonical form; concurrent C; concurrent programming languages; cost; critical path analysis; real-time Ada programs; system specification languages; Costs; Data acquisition; Data analysis; Dynamic programming; Hardware; Industrial control; Manufacturing systems; Petri nets; Real time systems; Timing;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 1989., Proceedings of the 32nd Midwest Symposium on

Conference_Location

Champaign, IL

Type

conf

DOI

10.1109/MWSCAS.1989.101815

Filename

101815