Petri Nets with Time and Cost

Parosh Aziz Abdulla; Richard Mayr

doi:10.4204/EPTCS.107.3

Petri Nets with Time and Cost

Parosh Aziz Abdulla, Richard Mayr

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

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.

Original language	English
Title of host publication	Proceedings 14th International Workshop on Verification of Infinite-State Systems, Infinity 2012, Paris, France, 27th August 2012.
Publisher	Cornell University Press
Pages	9-24
Number of pages	16
DOIs	https://doi.org/10.4204/EPTCS.107.3
Publication status	Published - 2012

Access to Document

10.4204/EPTCS.107.3

Abdulla Mayr 2012 Petri Nets with Time and Costs (Tutorial)Final published version, 204 KB

http://dx.doi.org/10.4204/EPTCS.107.3

Cite this

@inproceedings{45e06815c3024d219db8ba6b6f8af325,

title = "Petri Nets with Time and Cost",

abstract = "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.",

author = "Abdulla, {Parosh Aziz} and Richard Mayr",

year = "2012",

doi = "10.4204/EPTCS.107.3",

language = "English",

pages = "9--24",

booktitle = "Proceedings 14th International Workshop on Verification of Infinite-State Systems, Infinity 2012, Paris, France, 27th August 2012.",

publisher = "Cornell University Press",

}

TY - GEN

T1 - Petri Nets with Time and Cost

AU - Abdulla, Parosh Aziz

AU - Mayr, Richard

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

U2 - 10.4204/EPTCS.107.3

DO - 10.4204/EPTCS.107.3

M3 - Conference contribution

SP - 9

EP - 24

BT - Proceedings 14th International Workshop on Verification of Infinite-State Systems, Infinity 2012, Paris, France, 27th August 2012.

PB - Cornell University Press

ER -

Petri Nets with Time and Cost

Abstract

Access to Document

Fingerprint

Cite this