Timed continuous Petri nets and optimization via linear programming
Bruno Gaujal, Alessandro Giua · HAL (Le Centre pour la Communication Scientifique Directe) · 2002
In this paper, we consider a deterministic timed continuous Petri net model where conflicts at places are solved by using stationary routing parameters. We show how to compute the stationary firing rate for all transitions via linear programming, so as to determine the optimal routing parameters that maximize the firing rates. Finally, we discuss the relations with discrete Petri nets