In: Tag Gon Kim (Ed.): Lecture Notes in Computer Science, Vol. 3397: Artificial Intelligence and Simulation: 13th International Conference on AI, Simulation, Planning in High Autonomy Systems, AIS 2004, Jeju Island, Korea, October 4-6, 2004, pages 167-178. Springer-Verlag, 2005.
Abstract: The analysis of the scheduling problem in FMS using the transitive matrix has been studied. Since the control flows in the Petri nets are based on the token flows, the basic unit of concurrency (short BUC) could be defined to be a set of the executed control flows in the net. In addition, original system could be divided into some subnets such as BUC of the machine's operations and analyzed the feasibility time in each schedule. The usefulness of transitive matrix to slice off some subnets from the original net, and the explanation in an example will be discussed.