Petri Nets with Time and Cost

Petri Nets with Time and Cost

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

Full description

Bibliographic Details
Main Authors: Parosh Aziz Abdulla, Richard Mayr
Format: Article
Language:English
Published: Open Publishing Association 2013-02-01
Series:Electronic Proceedings in Theoretical Computer Science
Online Access:http://arxiv.org/pdf/1302.3291v1
id doaj-dc91df8162824f3a89c1f30284fc2d9d
record_format Article
spelling doaj-dc91df8162824f3a89c1f30284fc2d9d2020-11-24T23:45:58ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802013-02-01107Proc. Infinity 201292410.4204/EPTCS.107.3Petri Nets with Time and CostParosh Aziz AbdullaRichard MayrWe 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.http://arxiv.org/pdf/1302.3291v1
collection DOAJ
language English
format Article
sources DOAJ
author Parosh Aziz Abdulla
Richard Mayr
spellingShingle Parosh Aziz Abdulla
Richard Mayr
Petri Nets with Time and Cost
Electronic Proceedings in Theoretical Computer Science
author_facet Parosh Aziz Abdulla
Richard Mayr
author_sort Parosh Aziz Abdulla
title Petri Nets with Time and Cost
title_short Petri Nets with Time and Cost
title_full Petri Nets with Time and Cost
title_fullStr Petri Nets with Time and Cost
title_full_unstemmed Petri Nets with Time and Cost
title_sort petri nets with time and cost
publisher Open Publishing Association
series Electronic Proceedings in Theoretical Computer Science
issn 2075-2180
publishDate 2013-02-01
description 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.
url http://arxiv.org/pdf/1302.3291v1
work_keys_str_mv AT paroshazizabdulla petrinetswithtimeandcost
AT richardmayr petrinetswithtimeandcost
_version_ 1725495261749313536

Similar Items