For the most recent entries see the
Petri Nets Newsletter.
On the Complexity of Containment, Equivalence, and Reachability for Finite and 2-Dimensional Vector Addition Systems with States.
Some Complexity Bounds for Problems Concerning Finite and 2-Dimensional Vector Addition Systems with States.
Do you need a refined search? Try our search engine
which allows complex field-based queries.
Are you trying to get in contact with an author? Try our
database of Petri net researchers.
Back to the Petri Nets Bibliography