uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Computing Optimal Coverability Costs in Priced Timed Petri Nets
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems. (Algorithmic Program Verification)
2011 (English)In: LICS'2011, Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011, 399-408 p.Conference paper, Published paper (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
2011. 399-408 p.
Series
IEEE Symposium on Logic in Computer Science, ISSN 1043-6871
Keyword [en]
Formal verification, Petri nets, Timed Automata
National Category
Computer Science Computer Engineering
Identifiers
URN: urn:nbn:se:uu:diva-159328DOI: 10.1109/LICS.2011.40ISI: 000297350400041ISBN: 978-0-7695-4412-0 (print)OAI: oai:DiVA.org:uu-159328DiVA: diva2:444174
Conference
26th Annual IEEE Symposium on Logic in Computer Science (LICS) JUN 21-24, 2011 Toronto, CANADA
Projects
apvautomated verification of highly concurrent algorithmsUPMARC
Available from: 2011-09-28 Created: 2011-09-28 Last updated: 2012-01-13Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Abdulla, Parosh Aziz

Search in DiVA

By author/editor
Abdulla, Parosh Aziz
By organisation
Computer Systems
Computer ScienceComputer Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 436 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf