An Approach for Enumerating Minimal Siphons in a Subclass of Petri Nets
Siphons, as a structural object of Petri nets (PNs), are closely related to deadlock-freedom in PNs. Efficient siphon computation is of great importance in developing siphon-based deadlock control strategies with good performance. This paper is concerned with the enumeration of minimal siphons in a...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2018-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/8070302/ |
| id |
doaj-a3d6c2044376453f842cf6bc16131f0f |
|---|---|
| record_format |
Article |
| spelling |
doaj-a3d6c2044376453f842cf6bc16131f0f2021-03-29T20:30:09ZengIEEEIEEE Access2169-35362018-01-0164255426510.1109/ACCESS.2017.27637838070302An Approach for Enumerating Minimal Siphons in a Subclass of Petri NetsDan You0https://orcid.org/0000-0001-9088-9672Shouguang Wang1https://orcid.org/0000-0002-8998-0433Wenzhan Dai2Wenhui Wu3Yongshu Jia4School of Information and Electronic Engineering, Zhejiang Gongshang University, Hangzhou, ChinaSchool of Information and Electronic Engineering, Zhejiang Gongshang University, Hangzhou, ChinaSchool of Information and Electronic Engineering, Zhejiang Gongshang University, Hangzhou, ChinaSchool of Information and Electronic Engineering, Zhejiang Gongshang University, Hangzhou, ChinaZhejiang Industry and Trade Vocational College, Wenzou, ChinaSiphons, as a structural object of Petri nets (PNs), are closely related to deadlock-freedom in PNs. Efficient siphon computation is of great importance in developing siphon-based deadlock control strategies with good performance. This paper is concerned with the enumeration of minimal siphons in a subclass of PNs called systems of sequential systems with shared resources (S<sup>4</sup>PR). First, a method with polynomial complexity is proposed to decide whether a subset of resource places can generate a minimal siphon. Next, by utilizing the technique of problem partitioning, we develop an approach to compute all minimal siphons in S<sup>4</sup>PR. The proposed approach is illustrated by an example and its advantage is finally demonstrated via a comparison with other approaches.https://ieeexplore.ieee.org/document/8070302/Petri netsS⁴PR netsminimal siphon enumerationproblem partitioning |
| collection |
DOAJ |
| language |
English |
| format |
Article |
| sources |
DOAJ |
| author |
Dan You Shouguang Wang Wenzhan Dai Wenhui Wu Yongshu Jia |
| spellingShingle |
Dan You Shouguang Wang Wenzhan Dai Wenhui Wu Yongshu Jia An Approach for Enumerating Minimal Siphons in a Subclass of Petri Nets IEEE Access Petri nets S⁴PR nets minimal siphon enumeration problem partitioning |
| author_facet |
Dan You Shouguang Wang Wenzhan Dai Wenhui Wu Yongshu Jia |
| author_sort |
Dan You |
| title |
An Approach for Enumerating Minimal Siphons in a Subclass of Petri Nets |
| title_short |
An Approach for Enumerating Minimal Siphons in a Subclass of Petri Nets |
| title_full |
An Approach for Enumerating Minimal Siphons in a Subclass of Petri Nets |
| title_fullStr |
An Approach for Enumerating Minimal Siphons in a Subclass of Petri Nets |
| title_full_unstemmed |
An Approach for Enumerating Minimal Siphons in a Subclass of Petri Nets |
| title_sort |
approach for enumerating minimal siphons in a subclass of petri nets |
| publisher |
IEEE |
| series |
IEEE Access |
| issn |
2169-3536 |
| publishDate |
2018-01-01 |
| description |
Siphons, as a structural object of Petri nets (PNs), are closely related to deadlock-freedom in PNs. Efficient siphon computation is of great importance in developing siphon-based deadlock control strategies with good performance. This paper is concerned with the enumeration of minimal siphons in a subclass of PNs called systems of sequential systems with shared resources (S<sup>4</sup>PR). First, a method with polynomial complexity is proposed to decide whether a subset of resource places can generate a minimal siphon. Next, by utilizing the technique of problem partitioning, we develop an approach to compute all minimal siphons in S<sup>4</sup>PR. The proposed approach is illustrated by an example and its advantage is finally demonstrated via a comparison with other approaches. |
| topic |
Petri nets S⁴PR nets minimal siphon enumeration problem partitioning |
| url |
https://ieeexplore.ieee.org/document/8070302/ |
| work_keys_str_mv |
AT danyou anapproachforenumeratingminimalsiphonsinasubclassofpetrinets AT shouguangwang anapproachforenumeratingminimalsiphonsinasubclassofpetrinets AT wenzhandai anapproachforenumeratingminimalsiphonsinasubclassofpetrinets AT wenhuiwu anapproachforenumeratingminimalsiphonsinasubclassofpetrinets AT yongshujia anapproachforenumeratingminimalsiphonsinasubclassofpetrinets AT danyou approachforenumeratingminimalsiphonsinasubclassofpetrinets AT shouguangwang approachforenumeratingminimalsiphonsinasubclassofpetrinets AT wenzhandai approachforenumeratingminimalsiphonsinasubclassofpetrinets AT wenhuiwu approachforenumeratingminimalsiphonsinasubclassofpetrinets AT yongshujia approachforenumeratingminimalsiphonsinasubclassofpetrinets |
| _version_ |
1724194703632498688 |