Hartmanns, Arnd (2019): A Modest Markov Automata Tutorial (Artifact). Version 1. 4TU.ResearchData. dataset. https://doi.org/10.4121/uuid:5a73169e-b494-411b-b3a8-051e62efba9e

Dataset

• Distributed Computing
• Computation Theory and Mathematics

Dependability evaluation, Markov models, Modest language, Modest Toolset, Performance evaluation

CC BY 4.0

RefWorks, BibTeX, Reference Manager, Endnote, DataCite, NLM, DC, CFF

by Arnd Hartmanns

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. In our tutorial paper titled "A Modest Markov Automata Tutorial", we give 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. This artifact contains (1) all Modest models and (2) all command lines to run the Modest Toolset presented in the paper, and (3) a compatible version of the Modest Toolset.

• 2019-09-24 first online, published, posted

4TU.Centre for Research Data

media types: application/vnd.openxmlformats-officedocument.spreadsheetml.sheet, application/zip, text/csv, text/plain, text/x-msdos-batch

• https://doi.org/10.1007/978-3-030-31423-1_8

University of Twente, Faculty Of Electrical Engineering, Mathematics and Computer Science

• Hermanns, H. (Holger)