Skip to Main content Skip to Navigation
Reports

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

Sandie Balaguer 1, 2, * Thomas Chatain 2, 1 Stefan Haar 2, 1
* Corresponding author
1 MEXICO - Modeling and Exploitation of Interaction and Concurrency
LSV - Laboratoire Spécification et Vérification [Cachan], Inria Saclay - Ile de France
Abstract : 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.
Document type :
Reports
Complete list of metadata

Cited literature [2 references]  Display  Hide  Download

https://hal.inria.fr/inria-00504058
Contributor : Sandie Balaguer <>
Submitted on : Monday, July 19, 2010 - 10:03:26 PM
Last modification on : Monday, April 26, 2021 - 4:24:01 PM
Long-term archiving on: : Tuesday, October 23, 2012 - 10:40:58 AM

Files

RR-7338.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00504058, version 1

Citation

Sandie Balaguer, Thomas Chatain, Stefan Haar. A Concurrency-Preserving Translation from Time Petri Nets to Networks of Timed Automata. [Research Report] RR-7338, INRIA. 2010, pp.22. ⟨inria-00504058⟩

Share

Metrics

Record views

307

Files downloads

302