On time-average limits in deterministic and stochastic Petri
nets

D 2013

On time-average limits in deterministic and stochastic Petri nets

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

Basic information

Original name

On time-average limits in deterministic and stochastic Petri nets

Authors

BRÁZDIL, Tomáš (203 Czech Republic, belonging to the institution), Ľuboš KORENČIAK (703 Slovakia, belonging to the institution), Jan KRČÁL (203 Czech Republic, belonging to the institution), Jan KŘETÍNSKÝ (203 Czech Republic, guarantor, belonging to the institution) and Vojtěch ŘEHÁK (203 Czech Republic, belonging to the institution)

Edition

New York, ACM/SPEC International Conference on Performance Engineering, ICPE'13, p. 421-422, 2 pp. 2013

Publisher

ACM

Other information

Language

English

Type of outcome

Stať ve sborníku

Field of Study

10201 Computer sciences, information science, bioinformatics

Country of publisher

United States of America

Confidentiality degree

není předmětem státního či obchodního tajemství

Publication form

printed version "print"

RIV identification code

RIV/00216224:14330/13:00066145

Organization unit

Faculty of Informatics

ISBN

978-1-4503-1636-1

DOI

http://dx.doi.org/10.1145/2479871.2479936

Keywords in English

performance evaluation; stochastic Petri nets; stability

Abstract

V originále

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.

Links

GPP202/12/P612, research and development project

Name: Formální verifikace stochastických systémů s reálným časem (Acronym: Formální verifikace stochastických systémů s reáln)

Investor: Czech Science Foundation

MUNI/A/0760/2012, interní kód MU

Name: Rozsáhlé výpočetní systémy: modely, aplikace a verifikace II. (Acronym: FI MAV II.)

Investor: Masaryk University, Category A

Citovat

BRÁZDIL, Tomáš, Ľuboš KORENČIAK, Jan KRČÁL, Jan KŘETÍNSKÝ and Vojtěch ŘEHÁK. On time-average limits in deterministic and stochastic Petri nets. In ACM/SPEC International Conference on Performance Engineering, ICPE'13. New York: ACM, 2013, p. 421-422. ISBN 978-1-4503-1636-1. Available from: https://dx.doi.org/10.1145/2479871.2479936.

@inproceedings{1110174,
   author = {Brázdil, Tomáš and Korenčiak, Ľuboš and Krčál, Jan and Křetínský, Jan and Řehák, Vojtěch},
   address = {New York},
   booktitle = {ACM/SPEC International Conference on Performance Engineering, ICPE'13},
   doi = {http://dx.doi.org/10.1145/2479871.2479936},
   keywords = {performance evaluation; stochastic Petri nets; stability},
   howpublished = {tištěná verze "print"},
   language = {eng},
   location = {New York},
   isbn = {978-1-4503-1636-1},
   pages = {421-422},
   publisher = {ACM},
   title = {On time-average limits in deterministic and stochastic Petri nets},
   year = {2013}
}

TY  - JOUR
ID  - 1110174
AU  - Brázdil, Tomáš - Korenčiak, Ľuboš - Krčál, Jan - Křetínský, Jan - Řehák, Vojtěch
PY  - 2013
TI  - On time-average limits in deterministic and stochastic Petri nets
PB  - ACM
CY  - New York
SN  - 9781450316361
KW  - performance evaluation
KW  - stochastic Petri nets
KW  - stability
N2  - 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.
ER  -

BRÁZDIL, Tomáš, Ľuboš KORENČIAK, Jan KRČÁL, Jan KŘETÍNSKÝ and Vojtěch ŘEHÁK. On time-average limits in deterministic and stochastic Petri nets. In \textit{ACM/SPEC International Conference on Performance Engineering, ICPE'13}. New York: ACM, 2013, p.~421-422. ISBN~978-1-4503-1636-1. Available from: https://dx.doi.org/10.1145/2479871.2479936.

Detailed Information on Publication Record