Abstract
Bounded timed-arc Petri nets with read-arcs were recently proven equivalent to networks of timed automata, though the Petri net model cannot express urgent behaviour and the described mutual trans- lations are rather inefficient. We propose an extension of timed-arc Petri nets with invariants to enforce urgency and with transport arcs to generalise the read-arcs. We also describe a novel translation from the extended timed-arc Petri net model to networks of timed automata. The translation is implemented in the tool TAPAAL and it uses UPPAAL as the verification engine. Our experiments confirm the efficiency of the translation and in some cases the translated models verify significantly faster than the native UPPAAL models do.
Original language | English |
---|---|
Book series | Lecture Notes in Computer Science |
Volume | 5885 |
Pages (from-to) | 698-716 |
Number of pages | 18 |
ISSN | 0302-9743 |
DOIs | |
Publication status | Published - 2009 |
Event | 11th International Conference on Formal Engineering Methods (ICFEM'09) - Rio de Janeiro, Brazil Duration: 8 Dec 2009 → 11 Dec 2009 Conference number: 11 |
Conference
Conference | 11th International Conference on Formal Engineering Methods (ICFEM'09) |
---|---|
Number | 11 |
Country/Territory | Brazil |
City | Rio de Janeiro |
Period | 08/12/2009 → 11/12/2009 |
Keywords
- timed-arc Petri nets
- verification