Minimal Cost Reachability/Coverability in Priced Timed Petri Nets

Parosh Aziz Abdulla; Richard Mayr

doi:10.1007/978-3-642-00596-1_25

Minimal Cost Reachability/Coverability in Priced Timed Petri Nets

Parosh Aziz Abdulla, Richard Mayr

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

Abstract

We extend discrete-timed Petri nets with a cost model that assigns token storage costs to places and firing costs to transitions, and study the minimal cost reachability/coverability problem. We show that the minimal costs are computable if all storage/transition costs are non-negative, while even the question of zero-cost coverability is undecidable in the case of general integer costs.

Original language	English
Title of host publication	Foundations of Software Science and Computational Structures
Subtitle of host publication	12th International Conference, FOSSACS 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings
Pages	348-363
Number of pages	16
Volume	5504
ISBN (Electronic)	978-3-642-00596-1
DOIs	https://doi.org/10.1007/978-3-642-00596-1_25
Publication status	Published - 2009

Access to Document

10.1007/978-3-642-00596-1_25

Abdulla May 2009 Minimal Cost Reachability Coverability in Priced Timed Petri NetsAccepted author manuscript, 340 KB

http://dx.doi.org/10.1007/978-3-642-00596-1_25

Cite this

Abdulla, P. A., & Mayr, R. (2009). Minimal Cost Reachability/Coverability in Priced Timed Petri Nets. In Foundations of Software Science and Computational Structures: 12th International Conference, FOSSACS 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings (Vol. 5504, pp. 348-363) https://doi.org/10.1007/978-3-642-00596-1_25

Abdulla, Parosh Aziz ; Mayr, Richard. / Minimal Cost Reachability/Coverability in Priced Timed Petri Nets. Foundations of Software Science and Computational Structures: 12th International Conference, FOSSACS 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings. Vol. 5504 2009. pp. 348-363

@inproceedings{c2e9b27c0bc0424a8f65261368264881,

title = "Minimal Cost Reachability/Coverability in Priced Timed Petri Nets",

abstract = "We extend discrete-timed Petri nets with a cost model that assigns token storage costs to places and firing costs to transitions, and study the minimal cost reachability/coverability problem. We show that the minimal costs are computable if all storage/transition costs are non-negative, while even the question of zero-cost coverability is undecidable in the case of general integer costs.",

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

year = "2009",

doi = "10.1007/978-3-642-00596-1_25",

language = "English",

isbn = "978-3-642-00595-4",

volume = "5504",

pages = "348--363",

booktitle = "Foundations of Software Science and Computational Structures",

}

Abdulla, PA & Mayr, R 2009, Minimal Cost Reachability/Coverability in Priced Timed Petri Nets. in Foundations of Software Science and Computational Structures: 12th International Conference, FOSSACS 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings. vol. 5504, pp. 348-363. https://doi.org/10.1007/978-3-642-00596-1_25

Minimal Cost Reachability/Coverability in Priced Timed Petri Nets. / Abdulla, Parosh Aziz; Mayr, Richard.

Foundations of Software Science and Computational Structures: 12th International Conference, FOSSACS 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings. Vol. 5504 2009. p. 348-363.

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

TY - GEN

T1 - Minimal Cost Reachability/Coverability in Priced Timed Petri Nets

AU - Abdulla, Parosh Aziz

AU - Mayr, Richard

PY - 2009

Y1 - 2009

N2 - We extend discrete-timed Petri nets with a cost model that assigns token storage costs to places and firing costs to transitions, and study the minimal cost reachability/coverability problem. We show that the minimal costs are computable if all storage/transition costs are non-negative, while even the question of zero-cost coverability is undecidable in the case of general integer costs.

AB - We extend discrete-timed Petri nets with a cost model that assigns token storage costs to places and firing costs to transitions, and study the minimal cost reachability/coverability problem. We show that the minimal costs are computable if all storage/transition costs are non-negative, while even the question of zero-cost coverability is undecidable in the case of general integer costs.

U2 - 10.1007/978-3-642-00596-1_25

DO - 10.1007/978-3-642-00596-1_25

M3 - Conference contribution

SN - 978-3-642-00595-4

VL - 5504

SP - 348

EP - 363

BT - Foundations of Software Science and Computational Structures

ER -

Abdulla PA, Mayr R. Minimal Cost Reachability/Coverability in Priced Timed Petri Nets. In Foundations of Software Science and Computational Structures: 12th International Conference, FOSSACS 2009, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009, York, UK, March 22-29, 2009. Proceedings. Vol. 5504. 2009. p. 348-363 doi: 10.1007/978-3-642-00596-1_25

Minimal Cost Reachability/Coverability in Priced Timed Petri Nets

Abstract

Access to Document

Fingerprint

Cite this