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.
Type de document :
Communication dans un congrès
Proceedings of the Workshop on Automated Verification of Critical Systems (AVoCS'04), Sep 2004, London, United Kingdom. Elsevier, 128, pp.145--160, 2005, Elec. Notes in Theo. Comp. Science
https://hal.inria.fr/inria-00368582
Contributeur : Franck Cassez
<>
Soumis le : mardi 17 mars 2009 - 05:16:03
Dernière modification le : mercredi 19 décembre 2018 - 15:02:04
Document(s) archivé(s) le : mardi 8 juin 2010 - 21:36:12
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. Elsevier, 128, pp.145--160, 2005, Elec. Notes in Theo. Comp. Science. 〈inria-00368582〉
