Marking Predictability and Prediction in Labeled Petri Nets

This article studies the marking prediction problem in labeled Petri nets. Marking prediction aims to recognize a priori that the plant will inevitably reach a given set of alert markings in finite future steps. Specifically, we require that a marking prediction procedure should have the following properties: i) no missed alarm, i.e., an alarm can always be issued before reaching an alert marking; and ii) no false alarm, i.e., once an alarm is...