Unbounded Petri net expansion method for deadlock detection
A deadlock detection and consistent technology, applied in the computer field, can solve problems such as untriggerable transition sequence, unsuitable for unbounded Petri net deadlock detection, unreachable state identification, etc.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0058] Below in conjunction with accompanying drawing and specific embodiment the present invention is described in further detail:
[0059] A new method of unbounded Petri net expansion for deadlock detection, the input is unbounded prototype Petri net ∑=(P, T; F, M 0 ), the output is the network expansion Petri net ∑ is determined by place set, transition set and flow relation set as well as initial identification. For the emergence network constructed by the new unfolding technique, the condition set B includes three types of conditions, which are common conditions, ω + condition and ω - Conditions are represented by a circle, a circle with a dotted circle inside, and a circle with a dotted circle outside; E is the event set, and F' is the flow relationship set between the condition and the event, respectively. Represented by small rectangles and directed edges. h for The marking function of the nodes in the Petri net reflects the relationship between the nodes in t...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


