MARKING ESTIMATION OF PETRI NETS WITH ARBITRARY TRANSITION LABELING

In this paper we deal with the problem of estimating the marking of an arbitrary labeled Petri net system where two forms of nondeterminism may occur. Firstly there may exist unobservable transitions, i.e., transitions labeled with the empty string. Secondly, there may exist undistinguishable transitions, i.e., two or more transitions sharing the same symbol taken from a given alphabet E may simultaneously be enabled.