Loading [a11y]/accessibility-menu.js
Decomposition of Petri nets based on the behavior relation matrix | IEEE Conference Publication | IEEE Xplore

Decomposition of Petri nets based on the behavior relation matrix


Abstract:

To simplify the Petri net analysis, the decomposition technique is attracting more attention. Existing decomposition techniques mostly consider the structure, do not invo...Show More

Abstract:

To simplify the Petri net analysis, the decomposition technique is attracting more attention. Existing decomposition techniques mostly consider the structure, do not involve process behavior. In this article we present a new decomposition algorithm of Petri net with process behaviors. The behavior relation matrix is proposed in the paper. If elements of behavior relation matrix belongs to the same relation class, many problems (like matrix decomposition, Petri net decomposition problem) can be solved in a polynomial time. A Free-Choice Petri net can get only one behavior relation matrix, and the behavior relation matrix of a Free-Choice Petri net can be decomposed uniquely. And the whole decomposition process turns to be polynomial. An Workflow net and an Ada net as two experiments have demonstrated the effectiveness of the proposed idea.
Date of Conference: 29-31 July 2017
Date Added to IEEE Xplore: 25 June 2018
ISBN Information:
Conference Location: Guilin, China

References

References is not available for this document.