Sciweavers

Share
CORR
2011
Springer

Computing Optimal Coverability Costs in Priced Timed Petri Nets

7 years 9 months ago
Computing Optimal Coverability Costs in Priced Timed Petri Nets
—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 the ages of tokens. Our cost model assigns token storage costs per time unit to places, and firing costs to transitions. We study the cost to reach a given control-state. In general, a cost-optimal run may not exist. However, we show that the infimum of the costs is computable. Keywords-Formal verification; Petri nets; Timed Automata
Parosh Aziz Abdulla, Richard Mayr
Added 19 Aug 2011
Updated 19 Aug 2011
Type Journal
Year 2011
Where CORR
Authors Parosh Aziz Abdulla, Richard Mayr
Comments (0)
books