TY - GEN
T1 - Shortest paths in reachability graphs
AU - Desel, Jörg
AU - Esparza, Javier
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1993.
PY - 1993
Y1 - 1993
N2 - We prove the following property for safe conflict-free Petri nets and live and safe extended free-choice Petri nets: Given two markings M1, M2 of the reachability graph, if some path leads from M1 to M2, then some path of polynomial length in the number of transitions of the net leads from M1 to M2.
AB - We prove the following property for safe conflict-free Petri nets and live and safe extended free-choice Petri nets: Given two markings M1, M2 of the reachability graph, if some path leads from M1 to M2, then some path of polynomial length in the number of transitions of the net leads from M1 to M2.
UR - http://www.scopus.com/inward/record.url?scp=0012796557&partnerID=8YFLogxK
U2 - 10.1007/3-540-56863-8_49
DO - 10.1007/3-540-56863-8_49
M3 - Conference contribution
AN - SCOPUS:0012796557
SN - 9783540568636
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 224
EP - 241
BT - Application and Theory of Petri Nets 1993 - 14th International Conference, Proceedings
A2 - Ajmone Marsan, Marco
PB - Springer Verlag
T2 - 14th International Conference on Application and Theory of Petri Nets, 1993
Y2 - 21 June 1993 through 25 June 1993
ER -