Existence of home states in Petri nets is decidable

• Existence of home states in Petri nets is decidable.
• Reachability can be reduced to existence of home states.
• Both results are new.

We show that the problem whether a given Petri net has a home state (a marking reachable from every reachable marking) is decidable, and at least as hard as the reachability problem.