Behaviour equivalent max-plus automata for timed petri nets under open-loop race-policy semantics

Timed Petri nets and max-plus automata are well known modelling frameworks for timed discrete-event systems. In this paper we present an iterative procedure that constructs a max-plus automaton from a timed Petri net while retaining the timed behaviour. Regarding the Petri net, we essentially impose...

Ausführliche Beschreibung