Introduction to algorithms
Analyzing paths in time petri nets
Fundamenta Informaticae - Special issue on Petri nets
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Timed State Space Analysis of Real-Time Preemptive Systems
IEEE Transactions on Software Engineering
Hi-index | 0.00 |
In this paper, a method to determine best-case and worst-case times between two arbitrary markings in a bounded TPN is presented. The method uses a discrete subset of the state space of the net and achieves the results, which are integers, in polynomial time. As an application of the method the solution of a scheduling problem is shown.