2011/04/04 by Parosh Aziz Abdulla, Abdulla, Parosh Aziz, Richard Mayr +1
Computer Science · #Distributed systems and fault tolerance #F.1.1 #F.3.1 #FOS: Computer and information sciences #Formal Methods in Verification #Logic in Computer Science (cs.LO) #Petri Nets in System Modeling
paper · pdf · doi:10.48550/arxiv.1104.0617
openalex publication_date 2011/04/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.