An Effective Representation of the Reachability Set of Persistent Petri Nets

Abstract

In a persistent Petri net, an enabled transition can become disabled only by firing itself. Here, an algorithm is presented which constructs a semilinear representation of the set of states reachable in an arbitrary persistent Petri net.