Premium
Synthesis of deadlock prevention policy using Petri nets reachability graph technique
Author(s) -
Huang YiSheng,
Chung TaHsiang,
Su PinJune
Publication year - 2010
Publication title -
asian journal of control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.769
H-Index - 53
eISSN - 1934-6093
pISSN - 1561-8625
DOI - 10.1002/asjc.188
Subject(s) - petri net , reachability , deadlock , deadlock prevention algorithms , computer science , graph , stochastic petri net , control (management) , theoretical computer science , notice , distributed computing , artificial intelligence , political science , law
This paper proposes a subclass of generalized stochastic Petri net (GSPN) model, called TS 3 PR, which is modified the systems of simple sequential processes with resources (S 3 PR) with timed information. Based on the subclass of GSPN, a new deadlock prevention policy is developed by using reachability graph technique. The foundation of the new control policy is to manipulate all the dead states of the system nets. This study is able to change dead states into vanishing ones by additional immediate transitions. A live TS 3 PR model can then be obtained. It is worthwhile to notice that this study is different from adding additional control place policies in previous literature. Experimental results, indicate that our new control policy is with maximally permissive markings than conventional place‐control ones. As a result, we can infer that our proposed control policy seems to be used in Petri nets deadlocked systems. To our knowledge, this is the first work that employs the additional transitions to obtain the deadlock prevention policy. Copyright © 2010 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society