Data flow analysis of program nets

✍ Scribed by Kenji Onaga; Wai Kai Chen

• Book ID: 103088585
• Publisher: Elsevier Science
• Year: 1982
• Tongue: English
• Weight: 649 KB
• Volume: 313
• Category: Article
• ISSN: 0016-0032
• DOI: 10.1016/0016-0032(82)90088-6

✦ Synopsis

This paper deals with the data flow analysis of program nets by means of firing sequences, and presents some basic properties on maximal firing numbers and terminating conditions. Specifically, it is shown that a node in a program net is firable

if a certain subgraph containing the node does not exist. An algorithm for the determination of the maximal firing number is also presented.