Persistence of Vector Replacement Systems is Decidable
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 of not, and if so, to construct a semilinera representation of the set of state...
| Main Author: | |
|---|---|
| Published: |
2023
|
| Online Access: | https://hdl.handle.net/1721.1/149000 |
| Summary: | 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 of not, and if so, to construct a semilinera representation of the set of states reachable in the system. |
|---|