Minimal time reachability problem of some subclasses of timed Petri nets

Timed Petri net is an effective tool to evaluate discrete event systems. This paper treats the reachability problem of timed Petri nets. The problem aims to find the firing sequence which drives the initial marking M₀ to the target marking M_f in minimal execution time. First, we consider the subclass in which non-delayed sequence gives the optimal solution. Then, an algorithm is proposed to solve the minimal time reachability problem of timed state machines.