Computing Optimal Coverability Costs in Priced Timed Petri Nets

Parosh Aziz Abdulla, Richard Mayr

We consider timed Petri nets, i.e., unbounded Petri nets where each token carries a real-valued clock. Transition arcs are labeled with time intervals, which specify constraints on…