On time-average limits in deterministic and stochastic Petri nets

Investor logo

Warning

This publication doesn't include Institute of Computer Science. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

BRÁZDIL Tomáš KORENČIAK Ľuboš KRČÁL Jan KŘETÍNSKÝ Jan ŘEHÁK Vojtěch

Year of publication 2013
Type Article in Proceedings
Conference ACM/SPEC International Conference on Performance Engineering, ICPE'13
MU Faculty or unit

Faculty of Informatics

Citation
Doi http://dx.doi.org/10.1145/2479871.2479936
Field Informatics
Keywords performance evaluation; stochastic Petri nets; stability
Description In this poster paper, we study performance of systems modeled by deterministic and stochastic Petri nets (DSPN). As a performance measure, we consider long-run average time spent in a set of markings. Even though this measure often appears in DSPN literature, its existence has never been considered. We provide a DSPN model of a simple communication protocol in which the long-run average time spent in a fixed marking is {\em not} well-defined due to a highly unstable behavior of the model. Further, we introduce a syntactical restriction on DSPN which preserves most of the modeling power yet guarantees existence of the long-run average.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.

More info