In: Proc. IEEE Int. Conf. on Systems, Man, and Cybernetics (SMC'93), 17-20 October 1993, Le Touquet, France, Vol. 1, pages 289-294. 1993.
Abstract: This paper presents some algorithms for finding optimal or good schedules for some classes of Petri nets, and in particular the state-machine nets and some subclasses of free-choice nets. The analysis of these net classes is performed using only structural properties of the net. The optimal schedule is obtained for state-machine nets. For free-choice nets, depending on fork and join transitions, it is possible to obtain either the optimal schedule or a good one.
Keywords: discrete-event systems, free-choice Petri nets, schedule optimization.