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 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 statusE-pub ahead of print/First online - 13 Sep 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

    Flavors
    Distributed computer systems
    Costs

    Cite this

    Hartmanns, A., & Hermanns, H. (2019). A Modest Markov Automata Tutorial. In M. Krötzsch, & D. Stepanova (Eds.), 15th International Reasoning Web Summer School on Explainable Artificial Intelligence (RW 2019) (pp. 250-276). (Lecture Notes in Computer Science; Vol. 11810), (Information Systems and Applications, incl. Internet/Web, and HCI ). Springer. https://doi.org/10.1007/978-3-030-31423-1_8
    Hartmanns, Arnd ; Hermanns, Holger. / A Modest Markov Automata Tutorial. 15th International Reasoning Web Summer School on Explainable Artificial Intelligence (RW 2019). editor / Markus Krötzsch ; Daria Stepanova. Springer, 2019. pp. 250-276 (Lecture Notes in Computer Science). (Information Systems and Applications, incl. Internet/Web, and HCI ).
    @inproceedings{31727d6c56d04ce7b5f0a50e2699c212,
    title = "A Modest Markov Automata Tutorial",
    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.",
    author = "Arnd Hartmanns and Holger Hermanns",
    year = "2019",
    month = "9",
    day = "13",
    doi = "10.1007/978-3-030-31423-1_8",
    language = "English",
    isbn = "978-3-030-31422-4",
    series = "Lecture Notes in Computer Science",
    publisher = "Springer",
    pages = "250--276",
    editor = "Markus Kr{\"o}tzsch and Daria Stepanova",
    booktitle = "15th International Reasoning Web Summer School on Explainable Artificial Intelligence (RW 2019)",

    }

    Hartmanns, A & Hermanns, H 2019, A Modest Markov Automata Tutorial. in M Krötzsch & D Stepanova (eds), 15th International Reasoning Web Summer School on Explainable Artificial Intelligence (RW 2019). Lecture Notes in Computer Science, vol. 11810, Information Systems and Applications, incl. Internet/Web, and HCI , Springer, pp. 250-276, 15th International Summer School 2019, Bolzano, Italy, 20/09/19. https://doi.org/10.1007/978-3-030-31423-1_8

    A Modest Markov Automata Tutorial. / Hartmanns, Arnd; Hermanns, Holger.

    15th International Reasoning Web Summer School on Explainable Artificial Intelligence (RW 2019). ed. / Markus Krötzsch; Daria Stepanova. Springer, 2019. p. 250-276 (Lecture Notes in Computer Science; Vol. 11810), (Information Systems and Applications, incl. Internet/Web, and HCI ).

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

    TY - GEN

    T1 - A Modest Markov Automata Tutorial

    AU - Hartmanns, Arnd

    AU - Hermanns, Holger

    PY - 2019/9/13

    Y1 - 2019/9/13

    N2 - 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.

    AB - 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.

    U2 - 10.1007/978-3-030-31423-1_8

    DO - 10.1007/978-3-030-31423-1_8

    M3 - Conference contribution

    SN - 978-3-030-31422-4

    T3 - Lecture Notes in Computer Science

    SP - 250

    EP - 276

    BT - 15th International Reasoning Web Summer School on Explainable Artificial Intelligence (RW 2019)

    A2 - Krötzsch, Markus

    A2 - Stepanova, Daria

    PB - Springer

    ER -

    Hartmanns A, Hermanns H. A Modest Markov Automata Tutorial. In Krötzsch M, Stepanova D, editors, 15th International Reasoning Web Summer School on Explainable Artificial Intelligence (RW 2019). Springer. 2019. p. 250-276. (Lecture Notes in Computer Science). (Information Systems and Applications, incl. Internet/Web, and HCI ). https://doi.org/10.1007/978-3-030-31423-1_8