%0 Journal Article %1 Chao06 %A Chao, Daniel Y. %D 2006 %J The Computer Journal %K citas, citeulike deadlock, nets, petri, siphons, supervisory %N 4 %P 470--479 %R 10.1093/comjnl/bxl019 %T Computation of Elementary Siphons in Petri Nets For Deadlock Control %U http://dx.doi.org/10.1093/comjnl/bxl019 %V 49 %X When designing liveness-enforcing Petri net supervisors, unlike other techniques, Li et al. added control places and arcs to a plant net model for its elementary siphons only, greatly reducing the structural complexity of the controlled system. Their method, however, suffers from the expensive computation of siphons. We propose a new T-characteristic vector zeta to compute strict minimal siphons (SMS) for S3PR (systems of simple sequential processes with resources) in an algebraic fashion. For a special subclass of S3PR, called S4PR (simple S3PR), we discover that elementary siphons can be constructed from elementary circuits where all places are resources. Thus, the set of elementary siphons can be computed without the knowledge of all SMS. We also propose to construct characteristic T-vectors eta by building a graph to find dependent siphons without their computations. 10.1093/comjnl/bxl019

@article{Chao06, abstract = {{When designing liveness-enforcing Petri net supervisors, unlike other techniques, Li et al. added control places and arcs to a plant net model for its elementary siphons only, greatly reducing the structural complexity of the controlled system. Their method, however, suffers from the expensive computation of siphons. We propose a new T-characteristic vector zeta to compute strict minimal siphons (SMS) for S3PR (systems of simple sequential processes with resources) in an algebraic fashion. For a special subclass of S3PR, called S4PR (simple S3PR), we discover that elementary siphons can be constructed from elementary circuits where all places are resources. Thus, the set of elementary siphons can be computed without the knowledge of all SMS. We also propose to construct characteristic T-vectors eta by building a graph to find dependent siphons without their computations. 10.1093/comjnl/bxl019}}, added-at = {2017-09-08T10:52:59.000+0200}, author = {Chao, Daniel Y.}, biburl = {https://www.bibsonomy.org/bibtex/2ce250388b8dc1084c5b28d35dd162afc/fernand0}, citeulike-article-id = {889943}, citeulike-linkout-0 = {http://dx.doi.org/10.1093/comjnl/bxl019}, citeulike-linkout-1 = {http://comjnl.oxfordjournals.org/cgi/content/abstract/49/4/470}, day = 1, doi = {10.1093/comjnl/bxl019}, interhash = {38056c0e6f216820cc370efa9b4abfe3}, intrahash = {ce250388b8dc1084c5b28d35dd162afc}, journal = {The Computer Journal}, keywords = {citas, citeulike deadlock, nets, petri, siphons, supervisory}, month = jul, number = 4, pages = {470--479}, posted-at = {2006-10-09 09:48:33}, priority = {2}, timestamp = {2017-09-08T10:53:23.000+0200}, title = {{Computation of Elementary Siphons in Petri Nets For Deadlock Control}}, url = {http://dx.doi.org/10.1093/comjnl/bxl019}, volume = 49, year = 2006 }