Benutzer: Gast  Login
Autor(en):
Ernst W. Mayr; Jeremias Weihmann 
Titel:
Complexity Results for Fork-Free Petri Nets 
Abstract:
We investigate fork-free Petri nets (ff-PNs), which are those Petri nets for which each transition has at most one output place, connected by an arc with arbitrary multiplicity. We show that, for each reachable marking, there is a canonical firing sequence with nice properties leading to the marking. The existence of such sequences enables us to apply a mathematical framework for Petri nets which provides upper bounds for many classical problems. Using this framework and known lower bounds we sh...    »
 
Jahr:
2015 
Sprache:
en