Article ID Journal Published Year Pages File Type
427039 Information Processing Letters 2016 5 Pages PDF
Abstract

•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.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Existence of home states in Petri nets is decidable
Authors
, ,