Show simple item record

1981-01-01Zeitschriftenartikel DOI: 10.18452/9413
Ordered Firing in Petri Nets
dc.contributor.authorBurkhard, Hans-Dieter
dc.date.accessioned2017-06-17T01:00:14Z
dc.date.available2017-06-17T01:00:14Z
dc.date.created2008-09-15
dc.date.issued1981-01-01
dc.identifier.issn0013-5712
dc.identifier.urihttp://edoc.hu-berlin.de/18452/10065
dc.description.abstractTwo simple rules for solving conflicts and for ordering the firings of tronsitions in a Petri net are studied: 1. The "Maximum Strategy" (Salwicki, Müldner) whereby maximal sets of simultaneously fireble transitions are fired. 2. Firing in the order of enabling of transitions by some queue regimes. In both cases the computational power of Petri nets is extended up to the power of counter machines. As a consequence, the reachability, boundedness and liveness problems are all undecidable if the firing of transitions is ordered by the Maximum Strategy or by the considered queue regimes.eng
dc.language.isoeng
dc.publisherHumboldt-Universität zu Berlin
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/
dc.subjectpetri netseng
dc.subjectconflict solvingeng
dc.subjectordered firingeng
dc.subject.ddc004 Informatik
dc.titleOrdered Firing in Petri Nets
dc.typearticle
dc.identifier.urnurn:nbn:de:kobv:11-10091920
dc.identifier.doihttp://dx.doi.org/10.18452/9413
local.edoc.container-titleElektronische Informationsverarbeitung und Kybernetik (EIK)
local.edoc.type-nameZeitschriftenartikel
local.edoc.institutionHumboldt-Universität zu Berlin
local.edoc.container-typeperiodical
local.edoc.container-type-nameZeitschrift
local.edoc.container-volume17
local.edoc.container-issue2/3
local.edoc.container-year1981
local.edoc.container-firstpage71
local.edoc.container-lastpage86
dc.description.versionPeer Reviewed

Show simple item record