Computing Optimal Coverability Costs in Priced Timed Petri Nets
2011 (English)In: LICS'2011, Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011, 399-408 p.Conference paper (Refereed)
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.
Place, publisher, year, edition, pages
2011. 399-408 p.
, IEEE Symposium on Logic in Computer Science, ISSN 1043-6871
Formal verification, Petri nets, Timed Automata
Computer Science Computer Engineering
IdentifiersURN: urn:nbn:se:uu:diva-159328DOI: 10.1109/LICS.2011.40ISI: 000297350400041ISBN: 978-0-7695-4412-0OAI: oai:DiVA.org:uu-159328DiVA: diva2:444174
26th Annual IEEE Symposium on Logic in Computer Science (LICS) JUN 21-24, 2011 Toronto, CANADA
Projectsapvautomated verification of highly concurrent algorithmsUPMARC