Structural Translation from Time Petri Nets to Timed Automata

  • Authors:
  • Franck Cassez;Olivier-H. Roux

  • Affiliations:
  • IRCCyN/CNRS UMR 6597, BP 92101, 1 rue de la Noë, 44321 Nantes Cedex 3 France;IRCCyN/CNRS UMR 6597, BP 92101, 1 rue de la Noë, 44321 Nantes Cedex 3 France

  • Venue:
  • Electronic Notes in Theoretical Computer Science (ENTCS)
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

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, Uppaal or Cmc) to analyse TPNs.