Modeling of timed Petri nets using deterministic (max,+) automata

Automata with weights (multiplicities) in (max,+) algebra form a class of timed automata. Determinism is a crucial property for numerous results on (max,+) automata and, in particular, for applications to performance evaluation and control of a large class of timed discrete event systems. In this paper, we show how to build a deterministic (max, +) automaton equivalent to a live and safe timed Petri net in which, between any two transitions, there exists an oriented path which contains at most one “conflict place”