Minimal Cost Reachability/Coverability in Priced Timed Petri Nets

Abstract. We extend discrete-timed Petri nets with a cost model that assigns token storage costs to places and firing costs to transitions, and study the minimal cost reachability/coverability problem. We show that the minimal costs are computable if all storage/transition costs are non-negative, while even the question of zero-cost coverability is undecidable in the case of general integer costs.

• Type: Conference
• Year: 2009
• Where: FOSSACS
• Authors: Parosh Aziz Abdulla, Richard Mayr
• Keywords: Applied Computing, FOSSACS 2009, General Integer Costs, Minimal Costs, Token Storage Costs