A necessary and sufficient condition for a resource subset to generate a strict minimal siphon in S 4PR

SG Wang, D You, MC Zhou - IEEE Transactions on Automatic …, 2017 - ieeexplore.ieee.org
Systems of sequential systems with shared resources (S 4 PR) represent a class of Petri
nets that have powerful modeling capability for resource allocation systems. Their efficient …

An approach for enumerating minimal siphons in a subclass of Petri nets

D You, S Wang, W Dai, W Wu, Y Jia - IEEE Access, 2017 - ieeexplore.ieee.org
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 …

Necessary and sufficient liveness condition of GS3PR Petri nets

GY Liu, K Barkaoui - International Journal of Systems Science, 2015 - Taylor & Francis
Structural analysis is one of the most important and efficient methods to investigate the
behaviour of Petri nets. Liveness is a significant behavioural property of Petri nets. Siphons …

Computing minimal siphons in Petri net models of resource allocation systems: A parallel solution

F Tricas, J Ezpeleta - IEEE Transactions on Systems, Man, and …, 2006 - ieeexplore.ieee.org
Siphons are related to the liveness properties of Petri net models. This relation is strong in
the case of resource allocation systems (RASs). Siphons can be used in these systems in …

An effective algorithm to find elementary siphons in a class of Petri nets

AR Wang, Z Li, JY Jia, MC Zhou - IEEE Transactions on …, 2009 - ieeexplore.ieee.org
As a structural object of Petri nets, siphons play a key role in the development of deadlock
prevention policies for resource allocation systems. Elementary siphons are a novel concept …

Incremental approach to computation of elementary siphons for arbitrary simple sequential processes with resources

DY Chao - IET Control Theory & Applications, 2008 - IET
Computation of elementary siphons proposed by Li et al. is essential for deadlock control
and expensive since complete siphon enumeration of the Petri net is needed, and the …

[PDF][PDF] Deadlock prevention for sequence resource allocation systems

YS Huang - Journal of Information Science and Engineering, 2007 - Citeseer
Sequential Processes with Resources (ES3PR) and Systems of Simple Sequential
Processes with General Resource Requirements (S3PGR2) whose deadlocks are related to …

An algorithm to compute the minimal siphons in S 4 PR nets

EE Cano, CA Rovetto, JM Colom - Discrete Event Dynamic Systems, 2012 - Springer
Minimal siphons in the class of S 4 PR nets have become a conceptual and practical central
tool for the study of the resource allocation related aspects in discrete event dynamic …

On siphon computation for deadlock control in a class of Petri nets

ZW Li, MC Zhou - IEEE Transactions on Systems, Man, and …, 2008 - ieeexplore.ieee.org
As a structural object, siphons are well recognized in the analysis and control of deadlocks
in resource allocation systems modeled with Petri nets. Many deadlock prevention policies …

A method to compute strict minimal siphons in a class of Petri nets based on loop resource subsets

SG Wang, CY Wang, MC Zhou… - IEEE Transactions on …, 2011 - ieeexplore.ieee.org
Strict minimal siphons (SMS) play an important role in the development of deadlock control
policies for flexible manufacturing systems (FMS). For a class of Petri nets called Systems of …