Minimum Initial Marking Estimation in Labeled Petri Nets Using Minimum Token Number Prediction

This article proposes an approach to addressing the problem of minimum initial marking (MuIM) estimation for labeled Petri nets (LPNs). We introduce the important concept of a label synthesis net for LPNs and develop a method for predicting the minimum number of tokens. By using this prediction method, we develop an algorithm that has polynomial complexity in the length of the observed label sequence for estimating MuIMs. An illustrative example is provided to show the effectiveness and efficiency of our proposed approach. Moreover, experimental results demonstrate its advantage over existing work. Finally, we provide a comparison of some representative studies in the literature for MuIM estimation.