Algorithms for Extracting Minimal Siphons Containing Specified Places in a General Petri Net
نویسندگان
چکیده
Given a Petri net PN = (P, T, E), a siphon is a set S of places such that the set of input transitions to S is included in the set of output transitions from S. Concerning extraction of minimal siphons containing a given specified set Q of places, the paper proposes three algorithms based on the branch-and-bound method for enumerating, if any, all minimal siphons containing Q, as well as for extracting such one minimal siphon. key words: Petri nets, minimal siphons, branch-and-bound algorithms, siphon extraction
منابع مشابه
Time Complexity Analysis of the Minimal Siphon Extraction Problem of Petri Nets
Given a Petri net N = (P, T, E), a siphon is a set S of places such that the set of input transitions to S is included in the set of output transitions from S. Concerning extraction of one or more minimal siphons containing a given specified set Q of places, the paper shows several results on polynomial time solvability and NP -completeness, mainly for the case |Q| ≥ 1. key words: Petri nets, m...
متن کاملFinding minimal siphons and traps as a Constraint satisfaction Problem
Bridging the gap between quantitative and qualitative models, Petri nets (also known as place/transition graphs) have recently emerged as a promising tool for modeling and analysis of biochemical networks. In this paper, we present a method to compute the minimal siphons and traps of a Petri net as a resolution of a CSP. In our case, siphons and traps are purely structural properties that bring...
متن کاملA Graphic-Algebraic Computation of Elementary Siphons of BS3PR
Unlike other techniques, Li et al. add control nodes and arcs for only elementary siphons, thus reducing the number of control nodes and arcs required for deadlock control in Petri net supervisors. Their method suffers from the expensive computation of all SMS (Strict Minimal Siphons). We propose a graphic-algebra approach to compute elementary siphons without the knowledge of SMS. We show that...
متن کاملAn Incremental Approach to Extracting Minimal Bad Siphons
Finding all minimal bad siphons is essential for deadlock control. However, the number of siphons grows exponentially with the size of the system. Deadlock occurs due to inappropriate resource sharing. Hence most research focused on the problem of minimal siphon extraction covering a set of places representing resources — an NP-Complete problem for arbitrary Petri Nets. We develop the theory fo...
متن کاملA Fast Method for Extracting all Minimal Siphons from Maximal Unmarked Siphons of a Petri Net
In this paper, a fast method named algorithm 2 is proposed to extract all minimal siphons from maximal unmarked siphons obtained by the MIP-based deadlock detection method. Redundant computation is the major disadvantage of an existing method named algorithm 1 and it greatly decreases the computational efficiency of minimal siphons. In order to resolve this problem, the proposed method improves...
متن کامل