8485 articles  [version française]

inria-00072002, version 1

Timed continuous Petri nets and optimization via linear programming

Bruno Gaujal () 1, Alessandro Giua

N° RR-4583 (2002)

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

  • 1:  TRIO (INRIA Lorraine - LORIA)
  • INRIA – CNRS : UMR7503 – Université Henri Poincaré - Nancy I – Université Nancy II – Institut National Polytechnique de Lorraine (INPL)
  • Domain : Computer Science/Other
  • Keywords : CONTINUOUS PETRI NETS / OPTIMAL ROUTING / LINEAR PROGRAMMING
  • Internal note : RR-4583
 
  • inria-00072002, version 1
  • http://hal.inria.fr/inria-00072002
  • oai:hal.inria.fr:inria-00072002
  • From: Rapport De Recherche Inria <>
  • Submitted on: Tuesday, 23 May 2006 19:30:57
  • Updated on: Tuesday, 20 June 2006 15:28:30