Empty marking problem

Empty marking problem --- проблема нулевой разметки.

The empty marking problem for Petri nets consists in finding an algorithm for deciding whether or not the marking [math]\displaystyle{ (0,\ldots, 0) }[/math] is a reachable one for a given Petri net.