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 | 26th Annual IEEE Symposium on Logic in Computer Science (LICS 2011) |
| Publisher | Institute of Electrical and Electronics Engineers (IEEE) |
| Pages | 399-408 |
| Number of pages | 10 |
| ISBN (Electronic) | 978-0-7695-4412-0 |
| ISBN (Print) | 978-1-4577-0451-2 |
| DOIs | |
| Publication status | Published - 1 Jun 2011 |
| Event | 26th Annual IEEE Symposium on Logic in Computer Science - Toronto, Canada Duration: 21 Jun 2011 → 24 Jun 2011 http://www2.informatik.hu-berlin.de/lics/lics11/ |
Conference
| Conference | 26th Annual IEEE Symposium on Logic in Computer Science |
|---|---|
| Abbreviated title | LICS'11 |
| Country/Territory | Canada |
| City | Toronto |
| Period | 21/06/11 → 24/06/11 |
| Internet address |
Keywords
- concurrent systems
- formal verification
- optimal coverability costs
- priced timed Petri nets
- real-valued clock
- timed automata
- token storage costs
- transition arcs
- unbounded Petri nets
- Petri nets
- automata theory
- computational geometry
- formal specification