公开(公告)号：JPH02211546A

公开(公告)日：1990-08-22

申请号：JP3114689

申请日：1989-02-13

Applicant: IBM JAPAN

Inventor： HASEGAWA MASAKI ,  TENMYO TAKASHI

IPC: G06F9/46 ,  G06F9/52

Abstract: PURPOSE:To cancel the burden of a program execution for an operator by preparing a graph where the node of a task and an important resource are specifically arranged, and generating a token at every signal of a task execution start. CONSTITUTION:A process flow graph equivalent to a Petri net graph, which uses a unit process as the task, and has no multiple branch to express a driving type process nor its own loop, is prepared. A resource managing graph is generated from the graph and a task program TP, the important resource name necessary for the task is extracted, and a list is prepared. The PFG and the resource managing graph are loaded, and a process resource graph which does not generate the deadlock of common linkage is generated. The deadlock which can be generated in the graph of the common linkage is checked and displayed when the graph is generated. When the graph is executed, the mutual exclusive control of the resources and the control of the event driving type process are simultaneously executed. The tokens are placed at the node of the task and the node of the parallel resources. Thus the error of the resource managing program and the burden of the program execution can be canceled.