Sökning: id:"swepub:oai:DiVA.org:uu-159328" >
Computing Optimal C...
Computing Optimal Coverability Costs in Priced Timed Petri Nets
-
- Abdulla, Parosh Aziz, 1961- (författare)
- Uppsala universitet,Datorteknik,Algorithmic Program Verification
-
Richard, Mayr (författare)
-
(creator_code:org_t)
- 2011
- 2011
- Engelska.
-
Ingår i: LICS'2011, Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science. - 9780769544120 ; , s. 399-408
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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.
Ämnesord
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datorteknik (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Engineering (hsv//eng)
Nyckelord
- Formal verification
- Petri nets
- Timed Automata
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)
Hitta via bibliotek
Till lärosätets databas