Title :
Logical development of a Petri net deadlock analysis program
Author :
Cooke, Diniel E.
Author_Institution :
Dept. of Comput. Sci., Texas Univ., El Paso, TX, USA
Abstract :
If a well-structured concurrent program is represented as a Petri net, it is possible to analyze the network for deadlock. By well-structured concurrent program is meant one in which levels of nesting follow structured programming tenets. Program liveness is defined for a well-structured concurrent program represented as a Pefri net, a Prolog program which will analyze the Petri net for deadlock is presented, and it is proved that the program truly implements the specification of program liveness
Keywords :
Petri nets; parallel programming; system monitoring; Petri net deadlock analysis program; liveness; nesting; specification; structured programming; well-structured concurrent program; Calculus; Computer science; Concurrent computing; Formal specifications; History; Logic programming; Petri nets; Programming environments; Resource management; System recovery;
Conference_Titel :
Tools with Artificial Intelligence, 1992. TAI '92, Proceedings., Fourth International Conference on
Conference_Location :
Arlington, VA
Print_ISBN :
0-8186-2905-3
DOI :
10.1109/TAI.1992.246407
