A concurrency-preserving translation from time Petri nets to networks of timed automata

  • Authors:

  • Sandie Balaguer;Thomas Chatain;Stefan Haar

  • Affiliations:

  • INRIA, LSV, ENS Cachan, CNRS, Cachan, France 94230;INRIA, LSV, ENS Cachan, CNRS, Cachan, France 94230;INRIA, LSV, ENS Cachan, CNRS, Cachan, France 94230

  • Venue:
  • Formal Methods in System Design
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Several formalisms to model distributed real-time systems coexist in the literature. This naturally induces a need to compare their expressiveness and to translate models from one formalism to another when possible. The first formal comparisons of the expressiveness of these models focused on the preservation of the sequential behavior of the models, using notions like timed language equivalence or timed bisimilarity. They do not consider preservation of concurrency. In this paper we define timed traces as a partial order representation of executions of our models for real-time distributed systems. Timed traces provide an alternative to timed words, and take the distribution of actions into account. We propose a translation between two popular formalisms that describe timed concurrent systems: 1-bounded time Petri nets (TPN) and networks of timed automata (NTA). Our translation preserves the distribution of actions, that is we require that if the TPN represents the product of several components (called processes), then each process should have its counterpart as one timed automaton in the resulting NTA.