KORENČIAK, Ľuboš, Vojtěch ŘEHÁK and Adrian FARMADIN. Extension of PRISM by Synthesis of Optimal Timeouts in Fixed-Delay CTMC. In Erika Ábrahám, Marieke Huisman. Integrated Formal Methods. Switzerland: Springer International Publishing, 2016, p. 130-138. ISBN 978-3-319-33692-3. Available from: https://dx.doi.org/10.1007/978-3-319-33693-0_9.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Extension of PRISM by Synthesis of Optimal Timeouts in Fixed-Delay CTMC
Authors KORENČIAK, Ľuboš (703 Slovakia, belonging to the institution), Vojtěch ŘEHÁK (203 Czech Republic, guarantor, belonging to the institution) and Adrian FARMADIN (703 Slovakia, belonging to the institution).
Edition Switzerland, Integrated Formal Methods, p. 130-138, 9 pp. 2016.
Publisher Springer International Publishing
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Switzerland
Confidentiality degree is not subject to a state or trade secret
Publication form printed version "print"
WWW URL
Impact factor Impact factor: 0.402 in 2005
RIV identification code RIV/00216224:14330/16:00088084
Organization unit Faculty of Informatics
ISBN 978-3-319-33692-3
ISSN 0302-9743
Doi http://dx.doi.org/10.1007/978-3-319-33693-0_9
UT WoS 000379291800009
Keywords in English CTMC; DSPN; synthesis; timeout; expected reward; PRISM model checker
Tags firank_B, formela-conference
Tags International impact, Reviewed
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 13/5/2020 19:23.
Abstract
We present a practically appealing extension of the probabilistic model checker PRISM rendering it to handle fixed-delay continuous-time Markov chains (fdCTMCs) with rewards, the equivalent formalism to the deterministic and stochastic Petri nets (DSPNs). fdCTMCs allow transitions with fixed-delays (or timeouts) on top of the traditional transitions with exponential rates. Our extension supports an evaluation of expected reward until reaching a given set of target states. The main contribution is that, considering the fixed-delays as parameters, we implemented a synthesis algorithm that computes the epsilon-optimal values of the fixed-delays minimizing the expected reward. We provide a performance evaluation of the synthesis on practical examples.
Links
GBP202/12/G061, research and development projectName: Centrum excelence - Institut teoretické informatiky (CE-ITI) (Acronym: CE-ITI)
Investor: Czech Science Foundation
MUNI/A/0935/2015, interní kód MUName: Zapojení studentů Fakulty informatiky do mezinárodní vědecké komunity (Acronym: SKOMU)
Investor: Masaryk University, Category A
MUNI/A/0945/2015, interní kód MUName: Rozsáhlé výpočetní systémy: modely, aplikace a verifikace V.
Investor: Masaryk University, Category A
PrintDisplayed: 25/4/2024 20:09