A~Concurrency-Preserving Translation from Time Petri Nets to Networks of Timed Automata - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

A~Concurrency-Preserving Translation from Time Petri Nets to Networks of Timed Automata

Résumé

Real-time distributed systems may be modeled in different formalisms such as time Petri nets (TPN) and networks of timed automata (NTA). This paper focuses on translating a 1-bounded TPN into an NTA and considers an equivalence which takes the distribution of actions into account. This translation is extensible to bounded TPNs. We first use S-invariants to decompose the net into components that give the structure of the automata, then we add clocks to provide the timing information. Although we have to use an extended syntax in the timed automata, this is a novel approach since the other transformations and comparisons of these models did not consider the preservation of concurrency.
Fichier non déposé

Dates et versions

inria-00638283 , version 1 (04-11-2011)

Identifiants

Citer

Sandie Balaguer, Thomas Chatain, Stefan Haar. A~Concurrency-Preserving Translation from Time Petri Nets to Networks of Timed Automata. TIME'10 - Proceedings of the 17th International Symposium on Temporal Representation and Reasoning, Sep 2010, Paris, France, France. pp.77-84, ⟨10.1109/TIME.2010.12⟩. ⟨inria-00638283⟩
104 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More