In: IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E82-A, No. 3, pages 500-503. 1999.
Abstract: This paper proposes an algorithm for analyzing the reachability property of Petri nets by the use of unfoldings. It is known that analyzing the reachability by using unfoldings requires exponential time and space to the size of unfolding. The algorithm is based on the branch and bound technique, and experimental results show efficiency of the algorithm.
Keywords: Petri nets, reachability, state space explosion, unfoldings.