Skip to Main content Skip to Navigation

Timed continuous Petri nets and optimization via linear programming

Bruno Gaujal 1, 2 Alessandro Giua 2
1 TRIO - Real time and interoperability
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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
Document type :
Complete list of metadata

Cited literature [4 references]  Display  Hide  Download
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, May 23, 2006 - 7:30:57 PM
Last modification on : Friday, June 25, 2021 - 3:40:05 PM


  • HAL Id : inria-00072002, version 1


Bruno Gaujal, Alessandro Giua. Timed continuous Petri nets and optimization via linear programming. [Research Report] RR-4583, LIP RR-2002-35, INRIA, LIP. 2002. ⟨inria-00072002⟩



Record views


Files downloads