Show simple item record

1981-01-01Zeitschriftenartikel DOI: 10.18452/9418
Two Pumping Lemmata for Petri Nets
dc.contributor.authorBurkhard, Hans-Dieter
dc.date.accessioned2017-06-17T01:01:11Z
dc.date.available2017-06-17T01:01:11Z
dc.date.created2008-10-29
dc.date.issued1981-01-01
dc.identifier.issn0013-5712
dc.identifier.urihttp://edoc.hu-berlin.de/18452/10070
dc.description.abstractA careful analysis of the coverability tree for Petri nets shows that each infinite reachability set contains infinite linear subsets. This can be formulated as a pumping lemma for markings. It can also be shown that the nonterminal Petri net languages satisfy a pumping lemma similar to that for regular languages.eng
dc.language.isoeng
dc.publisherHumboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/
dc.subjectPetri netseng
dc.subjectpumping lemmaeng
dc.subject.ddc004 Informatik
dc.titleTwo Pumping Lemmata for Petri Nets
dc.typearticle
dc.identifier.urnurn:nbn:de:kobv:11-10092588
dc.identifier.doihttp://dx.doi.org/10.18452/9418
local.edoc.type-nameZeitschriftenartikel
local.edoc.container-typeperiodical
local.edoc.container-type-nameZeitschrift
local.edoc.container-year1981
dc.description.versionPeer Reviewed
dcterms.bibliographicCitation.journaltitleElektronische Informationsverarbeitung und Kybernetik (EIK)
dcterms.bibliographicCitation.volume17
dcterms.bibliographicCitation.issue7
dcterms.bibliographicCitation.pagestart349
dcterms.bibliographicCitation.pageend362
bua.departmentMathematisch-Naturwissenschaftliche Fakultät II

Show simple item record