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

This paper defines timed traces as a partial order representation of executions of models for real-time distributed systems. Timed traces provide an alternative to timed words and take the distribution of actions into account. The paper proposes a translation between two popular formalisms that describe timed concurrent systems: 1-bounded time Petri nets (TPN) and networks of timed automata (NTA). The translation preserves the distribution of actions, that is: 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.