Scheduling Analysis of FMS Using the Unfolding Time Petri Nets
Jong kun, Ouajdi Korb · 2008
Petri Net: Theory and Applications 282properties used by the transitive matrix are exhibited, it could be easier to analyze the system after slicing off some subnets.This paper is organized as follows: some definitions of Time Petri Nets(TPN) and unfolding are given in Section 2, and time Petri net slice is presented in Section 3, The scheduling objectives and outline the problems arising during the transformation of the initial model into an unfolding TPN are described in Section 4. In section 5, we introduce an illustration model for FMS, and specially emphasize the different ways of obtaining a closed loop model.In section 6, we are showing the benchmarking resultants after analyze using the performance evaluation factors.A conclusion and some perspectives will end this paper. Basic notions of time Petri nets and slicesIn this section certain terms that are often used in this paper are defined (Best,1990;Carlier,