Abstract
The behavior of a Petri net can be described by its reachability graph. However, the reachability graph of an unbounded Petri net has an infinite number of states. It is known that the coverability graph is a finite automatonthat approximates the reachability graph of the original unbounded Petri net. In this paper, we construct an approximating finite automaton that is different from the coverability graph.