Persistence of vector replacement systems is decidable

Ernst Mayr

doi:10.1007/BF00289268

Persistence of vector replacement systems is decidable

Ernst Mayr

Informatics 14 - Chair of Algorithms and Complexity

Research output: Contribution to journal › Article › peer-review

57 Scopus citations

Abstract

In a persistent vector replacement system (VRS) or Petri net, an enabled transition can become disabled only by firing itself. Here, an algorithm is presented which allows to decide whether an arbitrary VRS is persistent or not, and if so, to construct a semilinear representation of the set of states reachable in the system.

Original language	English
Pages (from-to)	309-318
Number of pages	10
Journal	Acta Informatica
Volume	15
Issue number	3
DOIs	https://doi.org/10.1007/BF00289268
State	Published - Jun 1981

Access to Document

10.1007/BF00289268

Cite this

@article{ed8837b4c3534278a4649dc885a480f6,

title = "Persistence of vector replacement systems is decidable",

abstract = "In a persistent vector replacement system (VRS) or Petri net, an enabled transition can become disabled only by firing itself. Here, an algorithm is presented which allows to decide whether an arbitrary VRS is persistent or not, and if so, to construct a semilinear representation of the set of states reachable in the system.",

author = "Ernst Mayr",

year = "1981",

month = jun,

doi = "10.1007/BF00289268",

language = "English",

volume = "15",

pages = "309--318",

journal = "Acta Informatica",

issn = "0001-5903",

publisher = "Springer New York",

number = "3",

}

TY - JOUR

T1 - Persistence of vector replacement systems is decidable

AU - Mayr, Ernst

PY - 1981/6

Y1 - 1981/6

N2 - In a persistent vector replacement system (VRS) or Petri net, an enabled transition can become disabled only by firing itself. Here, an algorithm is presented which allows to decide whether an arbitrary VRS is persistent or not, and if so, to construct a semilinear representation of the set of states reachable in the system.

AB - In a persistent vector replacement system (VRS) or Petri net, an enabled transition can become disabled only by firing itself. Here, an algorithm is presented which allows to decide whether an arbitrary VRS is persistent or not, and if so, to construct a semilinear representation of the set of states reachable in the system.

UR - http://www.scopus.com/inward/record.url?scp=0006471292&partnerID=8YFLogxK

U2 - 10.1007/BF00289268

DO - 10.1007/BF00289268

M3 - Article

AN - SCOPUS:0006471292

SN - 0001-5903

VL - 15

SP - 309

EP - 318

JO - Acta Informatica

JF - Acta Informatica

IS - 3

ER -

Persistence of vector replacement systems is decidable

Abstract

Access to Document

Other files and links

Fingerprint

Cite this