Ergodicity and Throughput Bounds of Petri Nets with UniqueConsistent Firing Count

@inproceedings{VectorJavier1991ErgodicityAT,
  title={Ergodicity and Throughput Bounds of Petri Nets with UniqueConsistent Firing Count},
  author={VectorJavier and Campos and Giovanni and Chiolay and Manuel Silva},
  year={1991}
}
This paper addresses ergodicity and throughput bounds characterizations for a subclass of timed and stochas-tic Petri nets, interleaving qualitative and quantitative theories. The considered nets represent an extension of the well known subclass of marked graphs, deened as having a unique consistent ring count vector, independently of the stochastic interpretation of the net model. In particular, persistent and mono-T-semiiow nets subclasses are considered. Upper and lower throughput bounds are… CONTINUE READING