Slices Analysis Method of Petri Nets in FMS Using the Transitive Matrix

Abstract In this paper, we focus on the analysis of the scheduling problem in FMS after slicing off some sub-nets using the transitive matrix. We can say that a control flows in the Petri nets is done based on the token flows. Accordingly, we define that the basic unit of concurrency (short BUC) is a set of the executed control flows based on the behavioral properties in the net. We can divide original system into some subnets based on machine’s operations using BUC and analyze the feasibility time in each schedules. Also, we show the usefulness of transitive matrix to slice off some subnets from the original net, and explain in an example.