New reachability trees for analyzing unbounded Petri nets with semilinear reachability sets

作者:Wang, Shouguang*; You, Dan; Zhou, Mengchu*
来源:Science China Information Sciences, 2018, 61(12): 129104.
DOI:10.1007/s11432-017-9446-3

摘要

<正>Dear editor,Analysis of reachability sets is of fundamental importance for a Petri net (PN). A reachability set can be represented by a reachability tree (RT),which is a powerful tool for intuitively checking the properties of PNs. Thus, properly construction of an RT is critical. Actually, constructing RTs to exactly characterize reachability sets for