Oopn's Reduction And Systems Deadlock Detection

Because the object-oriented Petri net's application is getting more and more widespread, as well as the importance of man-machine interaction behavior in software development process and practical application, therefore the paper devotes in the deadlock examination research through analyzes the object-oriented Petri net's structural property, using algebraic analysis method judges man-machine interaction system's object-oriented Petri net model whether to have the deadlock.Although the deadlock's research in the Petri net model already is very many, but generally aiming at the ordinary Petri net, could not be suitable well in the object-oriented Petri net and in the man-machine interaction system. Because the object-oriented Petri net synthesized the advantages of both ordinary Petri net and object-oriented technology this article has deeply researched the existing methods, and proposed one deadlock examination algorithm being suitable in the object-oriented Petri model.This algorithm acts according to the encapsulation of object-oriented technology, carries on the lamination to the object subnet, and conducts the research by analytic hierarchies thought to each object subnet, like this greatly reduced the complexity. In order to further reducing the complexity and effectively resolve state space explosive problem, according to the ordinary Petri fishing gear has characteristics in figures and diagrams and strict mathematics significance, proposes the six reduction rule maintaining the deadlock property, these reduction rule effectively reduced the point number which must analyze, and raised the nature analysis efficiency.The existing accessibility judgment's methods are mainly based on the place invariant and the equation of state, but the place invariant method has not contained net system initial marking completely, and the Petri net equation of state method is unable to describe the order of transition's fire. This article proposes one kind of new algorithm of Petri net 's accessibility, not only this algorithm has made up the above two method's shortcoming, moreover may effectively discover the way from initial marking reaching to goal marking, or judges goal marking not to be possible reached. And then proposes an algorithm to solve deadlock's marking. Finally synthesizes all analysis conclusion and the sub-algorithm, obtains the object-oriented Petri net system's complete dead lock examination algorithm.In the entire research process, the paper has summarized and induced many useful concepts and the conclusion, moreover these concepts and conclusions are also universal using to other correlation analyses.