A Modest Markov Automata Tutorial

Arnd Hartmanns*, Holger Hermanns

*Corresponding author for this work

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    1 Citation (Scopus)
    4 Downloads (Pure)

    Abstract

    Distributed computing systems provide many important services. To explain and understand why and how well they work, it is common practice to build, maintain, and analyse models of the systems’ behaviours. Markov models are frequently used to study operational phenomena of such systems. They are often represented with discrete state spaces, and come in various flavours, overarched by Markov automata. As such, Markov automata provide the ingredients that enable the study of a wide range of quantitative properties related to risk, cost, performance, and strategy. This tutorial paper gives an introduction to the formalism of Markov automata, to practical modelling of Markov automata in the Modest language, and to their analysis with the Modest Toolset. As case studies, we optimise an attack on Bitcoin, and evaluate the performance of a small but complex resource-sharing computing system.
    Original languageEnglish
    Title of host publication15th International Reasoning Web Summer School on Explainable Artificial Intelligence (RW 2019)
    EditorsMarkus Krötzsch, Daria Stepanova
    PublisherSpringer
    Pages250-276
    Number of pages27
    ISBN (Electronic)978-3-030-31423-1
    ISBN (Print)978-3-030-31422-4
    DOIs
    Publication statusPublished - 2019
    Event15th International Summer School 2019 - Bolzano, Italy
    Duration: 20 Sep 201924 Sep 2019

    Publication series

    NameLecture Notes in Computer Science
    PublisherSpringer
    Volume11810
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349
    NameInformation Systems and Applications, incl. Internet/Web, and HCI
    PublisherSpringer

    Conference

    Conference15th International Summer School 2019
    CountryItaly
    CityBolzano
    Period20/09/1924/09/19

    Fingerprint Dive into the research topics of 'A Modest Markov Automata Tutorial'. Together they form a unique fingerprint.

    Cite this