Abstract
Petri nets have been among the most succinct models that can describe
the structure and dynamics of discrete event-driven systems. In this paper, a necessary
condition for a 1-safe Petri net generating all the binary n-vectors and the existence of
1-safe Petri nets which generate every binary n-vector as one of their marking vectors
exactly once in the smallest possible number of steps have been established.
