In: Ajmone Marsan, M.: Lecture Notes in Computer Science, Vol. 691; Application and Theory of Petri Nets 1993, Proceedings 14th International Conference, Chicago, Illinois, USA, pages 493-512. Springer-Verlag, 1993.
Abstract: The subject of the paper is to propose two new priority-lists for scheduling in timed Petri nets. Both of the proposed priority-lists are constructed by taking feasibility into consideration, and our experimental evaluation on 10200 test problems shows their superiority over those by the Sifakis bounds that have been widely used.