The Complexity of the Finite Containment Problem for Petri Nets
If the reachability set of a Petri net (or, equivalently, vector addition system) is finite it can be effectively constructed. Furthermore, the finiteness is decidable. Thus, the containment and equality problem for finite reachability sets become solvable. We investigate the complexity of decisio...
Main Author: | |
---|---|
Other Authors: | |
Published: |
2023
|
Online Access: | https://hdl.handle.net/1721.1/149473 |