In this paper, we consider deterministic timed continuous Petri nets where conflicts at places are solved by assigning stationary routing parameters. We show how to compute the stationary firing rate at all transitions as well as how to determine the optimal routing parameters to maximize the firing rates. Finally, we discuss the relations with discrete Petri nets.

Optimal routing of continuous timed Petri nets

GIUA, ALESSANDRO
Ultimo
2002-01-01

Abstract

In this paper, we consider deterministic timed continuous Petri nets where conflicts at places are solved by assigning stationary routing parameters. We show how to compute the stationary firing rate at all transitions as well as how to determine the optimal routing parameters to maximize the firing rates. Finally, we discuss the relations with discrete Petri nets.
2002
Continuous Petri netsoptimal routinglinear programming
File in questo prodotto:
File Dimensione Formato  
02ifac_b.pdf

Solo gestori archivio

Tipologia: versione post-print
Dimensione 227.32 kB
Formato Adobe PDF
227.32 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11584/14583
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 4
  • ???jsp.display-item.citation.isi??? ND
social impact