TY - GEN
T1 - An efficient method for unfolding colored Petri nets
AU - Liu, Fei
AU - Heiner, Monika
AU - Yang, Ming
PY - 2012
Y1 - 2012
N2 - Unfolding is an essential problem in reusing existing Petri net simulation and analysis techniques and related tools for colored Petri nets. We present an efficient unfolding method, in which we provide two approaches to efficiently compute transition instances. That is, for a transition, if the color set of each variable in its guard is a finite integer domain, a constraint satisfaction approach is used to obtain all valid transition instances; otherwise, a general algorithm is adopted, in which some optimization techniques like partial binding - partial test and pattern matching are used. This method has been applied to unfold large-scale colored Petri nets, which has proven its efficiency.
AB - Unfolding is an essential problem in reusing existing Petri net simulation and analysis techniques and related tools for colored Petri nets. We present an efficient unfolding method, in which we provide two approaches to efficiently compute transition instances. That is, for a transition, if the color set of each variable in its guard is a finite integer domain, a constraint satisfaction approach is used to obtain all valid transition instances; otherwise, a general algorithm is adopted, in which some optimization techniques like partial binding - partial test and pattern matching are used. This method has been applied to unfold large-scale colored Petri nets, which has proven its efficiency.
UR - https://www.scopus.com/pages/publications/84874741781
U2 - 10.1109/WSC.2012.6465203
DO - 10.1109/WSC.2012.6465203
M3 - 会议稿件
AN - SCOPUS:84874741781
SN - 9781467347792
T3 - Proceedings - Winter Simulation Conference
BT - Proceedings of the 2012 Winter Simulation Conference, WSC 2012
T2 - 2012 Winter Simulation Conference, WSC 2012
Y2 - 9 December 2012 through 12 December 2012
ER -