Skip to main navigation Skip to search Skip to main content

Operational analysis of timed Petri nets and application to the computation of performance bounds

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Operational analysis techniques are used to partially characterize the behavior 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 queuing network models. 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 is shown. 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 colored nets appears straightforward and allows an efficient exploitation of model symmetries.

Original languageEnglish
Title of host publicationProceedings of 5th International Workshop on Petri Nets and Performance Models, PNPM 1993
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages128-137
Number of pages10
ISBN (Electronic)0818642505, 9780818642500
DOIs
Publication statusPublished - 1993
Externally publishedYes
Event5th International Workshop on Petri Nets and Performance Models, PNPM 1993 - Toulouse, France
Duration: 19 Oct 199322 Oct 1993

Publication series

NameProceedings of 5th International Workshop on Petri Nets and Performance Models, PNPM 1993

Conference

Conference5th International Workshop on Petri Nets and Performance Models, PNPM 1993
Country/TerritoryFrance
CityToulouse
Period19/10/9322/10/93

Fingerprint

Dive into the research topics of 'Operational analysis of timed Petri nets and application to the computation of performance bounds'. Together they form a unique fingerprint.

Cite this