Properties and Steady-State Performance Bounds for Petri Nets with Unique Repetitive Firing Count Vector (1989)
| Citations: | 6 - 6 self |
BibTeX
@MISC{Campos89propertiesand,
author = {J. Campos and G. Chiola and M. Silva},
title = {Properties and Steady-State Performance Bounds for Petri Nets with Unique Repetitive Firing Count Vector},
year = {1989}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The problem of computing both upper and lower bounds for the steady-state performance of timed and stochastic Petri nets is studied. In particular, Linear Programming problems defined on the incidence matrix of underlying Petri net are used to compute bounds for the throughput of transitions for live and bounded nets with a unique possibility of steady-state behaviour. These classes of nets are defined and their characteristics are studied. The bounds proposed here depend on the initial marking and the mean values of the delays but not on the probability distributions (thus including both the deterministic and the stochastic cases); moreover they can be computed also for non-ergodic models. Connections between results and techniques typical of qualitative and quantitative analysis of Petri models are stressed. 1 Introduction In this paper, which is a continuation of the companion paper [CCCS89], we study the possibility of obtaining (upper and lower) bounds on the steady-state perform...
