A Modest Markov Automata Tutorial

Arnd Hartmanns; Holger Hermanns

doi:10.1007/978-3-030-31423-1_8

A Modest Markov Automata Tutorial

Arnd Hartmanns^*, Holger Hermanns

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

4 Citations (Scopus)

23 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 language	English
Title of host publication	15th International Reasoning Web Summer School on Explainable Artificial Intelligence (RW 2019)
Editors	Markus Krötzsch, Daria Stepanova
Publisher	Springer
Pages	250-276
Number of pages	27
ISBN (Electronic)	978-3-030-31423-1
ISBN (Print)	978-3-030-31422-4
DOIs	https://doi.org/10.1007/978-3-030-31423-1_8
Publication status	Published - 2019
Event	15th International Summer School 2019 - Bolzano, Italy Duration: 20 Sept 2019 → 24 Sept 2019

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	11810
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Name	Information Systems and Applications, incl. Internet/Web, and HCI
Publisher	Springer

Conference

Conference	15th International Summer School 2019
Country/Territory	Italy
City	Bolzano
Period	20/09/19 → 24/09/19

Access to Document

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

A Modest Markov Automata Tutorial (Artifact)
Hartmanns, A. (Creator) & Hermanns, H. (Contributor), 4TU.Centre for Research Data, 24 Sept 2019
DOI: 10.4121/uuid:5a73169e-b494-411b-b3a8-051e62efba9e
Dataset

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

@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{\textquoteright} 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",

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)",

address = "Germany",

note = "15th International Summer School 2019 ; Conference date: 20-09-2019 Through 24-09-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 proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - A Modest Markov Automata Tutorial

AU - Hartmanns, Arnd

AU - Hermanns, Holger

PY - 2019

Y1 - 2019

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

T2 - 15th International Summer School 2019

Y2 - 20 September 2019 through 24 September 2019

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 ). Epub 2019 Sept 13. doi: 10.1007/978-3-030-31423-1_8

A Modest Markov Automata Tutorial

Abstract

Publication series

Conference

Access to Document

Fingerprint

Datasets

A Modest Markov Automata Tutorial (Artifact)

Cite this