Decidability Questions for Petri Nets

Abstract

An understanding of the mathematical properties of Petri Nets is essential when one wishes to use Petri Nets as an abstract model for concurrent systems. The decidability of various problems which arise in this context is an important aspect of this question. The fact that these problems also arise in the context of other mathematical theories, such as commutative, closure under linear relations, Matrix Context-Free grammars, or Weak Counter Automata, provides further motivation.