HERMANNS, Holger, Jan KRČÁL and Jan KŘETÍNSKÝ. Compositional Verification and Optimization of Interactive Markov Chains. In CONCUR 2013 - Concurrency Theory - 24th International Conference. Heidelberg Dordrecht London New York: Springer, 2013, p. 364-379. ISBN 978-3-642-40183-1. Available from: https://dx.doi.org/10.1007/978-3-642-40184-8_26.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Compositional Verification and Optimization of Interactive Markov Chains
Authors HERMANNS, Holger (276 Germany), Jan KRČÁL (203 Czech Republic, belonging to the institution) and Jan KŘETÍNSKÝ (203 Czech Republic, guarantor, belonging to the institution).
Edition Heidelberg Dordrecht London New York, CONCUR 2013 - Concurrency Theory - 24th International Conference, p. 364-379, 16 pp. 2013.
Publisher Springer
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Germany
Confidentiality degree is not subject to a state or trade secret
Publication form printed version "print"
Impact factor Impact factor: 0.402 in 2005
RIV identification code RIV/00216224:14330/13:00066202
Organization unit Faculty of Informatics
ISBN 978-3-642-40183-1
ISSN 0302-9743
Doi http://dx.doi.org/10.1007/978-3-642-40184-8_26
Keywords in English interactive Markov chains; continuous-time stochstic systems; composition; verification; specification
Tags core_A, firank_A, formela-conference
Tags International impact, Reviewed
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 27/4/2014 23:21.
Abstract
Interactive Markov chains (IMC) are compositional behavioural models extending labelled transition systems and continuous-time Markov chains. We provide a framework and algorithms for compositional verification and optimization of IMC with respect to time-bounded properties. Firstly, we give a specification formalism for IMC. Secondly, given a time-bounded property, an IMC component and the assumption that its unknown environment satisfies a given specification, we synthesize a scheduler for the component optimizing the probability that the property is satisfied in any such environment.
Links
GBP202/12/G061, research and development projectName: Centrum excelence - Institut teoretické informatiky (CE-ITI) (Acronym: CE-ITI)
Investor: Czech Science Foundation
MUNI/A/0739/2012, interní kód MUName: Zapojení studentů Fakulty informatiky do mezinárodní vědecké komunity (Acronym: SKOMU)
Investor: Masaryk University, Category A
MUNI/A/0760/2012, interní kód MUName: Rozsáhlé výpočetní systémy: modely, aplikace a verifikace II. (Acronym: FI MAV II.)
Investor: Masaryk University, Category A
PrintDisplayed: 26/4/2024 17:32