摘要
The parallel program verification can be divided into two aspects, the communicationand computation verification. In this paper, we mainly study the communication verification. First,we establish the Petri net specification for communication functions and basic statements of PVM;then, we give the steps of designing program verification model and abstract the abnormal phenomenonthat users often meet in the PVM parallel program into the characters of Petri net (including soleinformation, insufficient information, deadlock and livelock); finally, we give some detection algorithmto help users to eliminate these errors. In order to decrease the complexity of verification, we proposeseveral rules to simple the verification model.
The parallel program verification can be divided into two aspects, the communicationand computation verification. In this paper, we mainly study the communication verification. First,we establish the Petri net specification for communication functions and basic statements of PVM;then, we give the steps of designing program verification model and abstract the abnormal phenomenonthat users often meet in the PVM parallel program into the characters of Petri net (including soleinformation, insufficient information, deadlock and livelock); finally, we give some detection algorithmto help users to eliminate these errors. In order to decrease the complexity of verification, we proposeseveral rules to simple the verification model.
