Acta Informatica

, Volume 15, Issue 3, pp 309-318

First online:

Persistence of vector replacement systems is decidable

  • Ernst MayrAffiliated withInstitut für Informatik, Technische Universität München

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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.