For the most recent entries see the Petri Nets Newsletter.

Operational Analysis of Timed Petri Nets and Application to the Computation of Performance Bounds.

Chiola, G.; Anglano, C.; Campos, J.; Colom, J.M.; Silva, M.

In: Boxma, O.J.; Koole, G.M.: Performance Evaluation of parallel and distributed systems. Solution Methods, CWI Tracts, Vol. 106, pages 197-213. Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands, 1994.

Abstract: We use operational analysis techniques to partially characterize the behaviour of timed Petri nets under very weak assumptions on their timing semantics. New operational inequalities are derived that are typical of the presence of synchronization and that were therefore not considered in queueing network models. We show an interesting application of the operational laws to the statement and the efficient solution of problems related to the estimation of performance bounds insensitive to the timing probability distributions. The results obtained generalize and improve in a clear setting results that were derived in the last few years for several different subclasses of timed Petri nets. In particular the extension to Well-Formed Coloured nets appears straightforward and allows an efficient exploitation of models symmetries.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography