Sciweavers

23
Voted
ICFEM
2009
Springer

An Efficient Translation of Timed-Arc Petri Nets to Networks of Timed Automata

13 years 3 months ago
An Efficient Translation of Timed-Arc Petri Nets to Networks of Timed Automata
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 translations 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.
Joakim Byg, Kenneth Yrke Jørgensen, Jir&iac
Added 19 Feb 2011
Updated 19 Feb 2011
Type Journal
Year 2009
Where ICFEM
Authors Joakim Byg, Kenneth Yrke Jørgensen, Jirí Srba
Comments (0)