Computing Optimal Coverability Costs in Priced Timed Petri Nets

Details Computing Optimal Coverability Costs in Priced Timed Petri Nets Computing Optimal Coverability Costs in Priced Timed Petri Nets

2011-04-04

arxiv.org/abs/1104.0617v1

Computer Science

Logic in Computer Science

26 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Computing Optimal Coverability Costs in Priced Timed Petri Nets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computing Optimal Coverability Costs in Priced Timed Petri Nets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing Optimal Coverability Costs in Priced Timed Petri Nets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-318338