Persistence of vector replacement systems is decidable
- Cite this article as:
- Mayr, E. Acta Informatica (1981) 15: 309. doi:10.1007/BF00289268
- 60 Downloads
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.