In: IEICE Trans. on Fundamentals in Electronics, Communications and Computers, Vol. E83-A, No. 11, pages 2188-2195. 2000.
Abstract: Generating state spaces is one of the general and important methods in the analysis of Petri nets. There are two reasons why state spaces of Petri nets become so large. One is concurrent occurrence of transitions, and the other is periodic occurrence of firing sequences. The paper focuses on the second problem and proposes a new algorithm for exploring state spaces of finite capacity Petri nets with large capacities. In the proposed algorithm, the state space is represented in the form of a tree such that a set of markings generated by periodic occurrences of firing sequences is associated with each node, and it is much smaller than the reachability graph.
Keywords: Petri nets, large capacities, reachability analysis.
Back to the Petri Nets Bibliography