The novel algorithm for determining the reachability in acyclic Petri nets

Abstract

A novel algorithm for determining the reachability of a marking in acyclic Petri nets is proposed. For this algorithm, a Petri net is represented in the matrix form, with a given pair of initial and target markings. The algorithm is based on the creation of a temporal ordering relation for transition firings and on using this relation for determining the shortest sequence of transition firings transforming the initial marking into the target one. By solving the fundamental equation of the Petri net, the algorithm determines initially whether the target marking is reachable from the given initial marking, and, in case it is, produces the shortest sequence of transition firings which transforms the initial marking into the target one.

DOI: 10.1145/261342.261351

Extracted Key Phrases

3 Figures and Tables

Cite this paper

@article{Kostin1997TheNA, title={The novel algorithm for determining the reachability in acyclic Petri nets}, author={Alexander E. Kostin}, journal={SIGACT News}, year={1997}, volume={28}, pages={70-79} }