Skip to Main Content
In this paper, we suggests a WIP (work in process) of FMS analysis methods based on the TPN (time Petri nets) unfolding. Unfolding of PN is a partial order-based method for the verification of concurrent system without the state space explosion. The aim of this work is to formulate the general cyclic state scheduling problem to minimize the WIP to satisfy economical constraints. The method is based on unfolding of the original net into the equivalent acyclic description.