Colored Petri net models of concurrent Ada programs

Author

Stansifer, Ryan ; Marinescu, Dan

Author_Institution

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

fYear

1990

fDate

12-14 Aug 1990

Firstpage

766

Abstract

A translation is presented of a subset of the programming language Ada to colored Petri nets. The subset contains the Ada rendezvous and dynamic task creation but does not contain loops. The author uses colored nets to cut down the complexity of rendezvous and to include subprocedures and generics. The design of the translation algorithm was influenced by methods of denotational semantics which made the implementation of the algorithm particularly simple in the programming language ML. Properties of a concurrent Ada program can be studied by analyzing the Petri net model. It is possible to determine the possible interleavings of statements and do static dead-lock detection

Keywords

Ada; Petri nets; concurrency control; graph colouring; parallel programming; programming theory; Ada rendezvous; ML; colored Petri nets; concurrent Ada programs; denotational semantics; dynamic task creation; programming language; statement interleaving; static dead-lock detection; translation algorithm; Algorithm design and analysis; Computer industry; Computer languages; Concurrent computing; Interleaved codes; Joining processes; Packaging; Petri nets; Software engineering; Terminology;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 1990., Proceedings of the 33rd Midwest Symposium on

Conference_Location

Calgary, Alta.

Print_ISBN

0-7803-0081-5

Type

conf

DOI

10.1109/MWSCAS.1990.140833

Filename

140833