The novel algorithm for determining the reachability in acyclic Petri nets

Authors:
A. E. Kostin
Affiliations:
Dept o f Computer Engineering, Eastern Mediterranean University, Magusa, KKTC, Mersin, 10, Turkey
Venue:
ACM SIGACT News
Year:
1997

Citing 0
Cited 2

Structuring Acyclic Petri Nets for Reachability Analysis and Control

Discrete Event Dynamic Systems
A reachability algorithm for general petri nets based on transition invariants

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.