Abstract : In this paper, we consider Time Petri Nets (TPN) where time is associated with transitions. We give a formal semantics for TPNs in terms of Timed Transition Systems. Then, we propose a translation from TPNs to Timed Automata (TA) that preserves the behavioural semantics (timed bisimilarity) of the TPNs. For the theory of TPNs this result is two-fold: i) reachability problems and more generally TCTL model-checking are decidable for bounded TPNs; ii) allowing strict time constraints on transitions for TPNs preserves the results described in i). The practical applications of the translation are: i) one can specify a system using both TPNs and Timed Automata and a precise semantics is given to the composition; ii) one can use existing tools for analysing timed automata (like KRONOS or UPPAAL or CMC) to analyse TPNs.
https://hal.inria.fr/inria-00368582
Contributor : Franck Cassez
<>
Submitted on : Tuesday, March 17, 2009 - 5:16:03 AM
Last modification on : Wednesday, December 19, 2018 - 3:02:04 PM
Document(s) archivé(s) le : Tuesday, June 8, 2010 - 9:36:12 PM
Franck Cassez, Olivier Henri Roux. Structural Translation of Time Petri Nets into Timed Automata. Proceedings of the Workshop on Automated Verification of Critical Systems (AVoCS'04), Sep 2004, London, United Kingdom. pp.145--160. ⟨inria-00368582⟩
