Verification of open interactive Markov chains

Tomáš Brázdil, Holger Hermanns, Jan Krčál, Jan Křetínský, Vojtěch Řehák

Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

13 Zitate (Scopus)

Abstract

Interactive Markov chains (IMC) are compositional behavioral models extending both labeled transition systems and continuous-time Markov chains. IMC pair modeling convenience - owed to compositionality properties - with effective verification algorithms and tools - owed to Markov properties. Thus far however, IMC verification did not consider compositionality properties, but considered closed systems. This paper discusses the evaluation of IMC in an open and thus compositional interpretation. For this we embed the IMC into a game that is played with the environment. We devise algorithms that enable us to derive bounds on reachability probabilities that are assured to hold in any composition context.

OriginalspracheEnglisch
Titel32nd International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012
Seiten474-485
Seitenumfang12
DOIs
PublikationsstatusVeröffentlicht - 2012
Veranstaltung32nd International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012 - Hyderabad, Indien
Dauer: 15 Dez. 201217 Dez. 2012

Publikationsreihe

NameLeibniz International Proceedings in Informatics, LIPIcs
Band18
ISSN (Print)1868-8969

Konferenz

Konferenz32nd International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012
Land/GebietIndien
OrtHyderabad
Zeitraum15/12/1217/12/12

Fingerprint

Untersuchen Sie die Forschungsthemen von „Verification of open interactive Markov chains“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren