Marking Estimation of Petri Nets With Silent Transitions

In this paper, we deal with the problem of estimating the marking of a labeled Petri net system based on the observation of transitions labels. In particular, we assume that a certain number of transitions are labeled with the empty string , while unique labels taken from a given alphabet are assigned to each of the other transitions. Transitions labeled with the empty string are called silent because their firing cannot be observed. Under some...