Minimal Cost Reachability/Coverability in Priced Timed Petri Nets

Parosh Aziz Abdulla, Richard Mayr

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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.
Original languageEnglish
Title of host publicationFoundations of Software Science and Computational Structures
Subtitle of host publication12th International Conference, FOSSACS 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings
Number of pages16
ISBN (Electronic)978-3-642-00596-1
Publication statusPublished - 2009


Dive into the research topics of 'Minimal Cost Reachability/Coverability in Priced Timed Petri Nets'. Together they form a unique fingerprint.

Cite this