Controllability for siphons in S3PGR2
ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
Transition-Based Deadlock Detection and Recovery Policy for FMSs Using Graph Technique
ACM Transactions on Embedded Computing Systems (TECS) - Special Issue on Modeling and Verification of Discrete Event Systems
| Hi-index | 0.00 |
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 ζ 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 η by building a graph to find dependent siphons without their computations.