Confluence reduction for Markov automata

Autor: Joost-Pieter Katoen, Mark Timmer, Jaco van de Pol, Mariëlle Stoelinga

Publikováno v: Theoretical computer science, 655(B), 193-219. Elsevier

Markov automata are a novel formalism for specifying systems exhibiting nondeterminism, probabilistic choices and Markovian rates. As expected, the state space explosion threatens the analysability of these models. We therefore introduce confluence r

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b386e425286dbe892c16dae878872101
https://doi.org/10.1016/j.tcs.2016.01.017

Confluence reduction for Markov automata (extended version)

Markov automata are a novel formalism for specifying systems exhibiting nondeterminism, probabilistic choices and Markovian rates. Recently, the process algebra MAPA was introduced to efficiently model such systems. As always, the state space explosi

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dris___00893::180d0eac14a69176e1a3c76515cc125b

Confluence reduction for Markov automata

Autor: Timmer, Mark, van de Pol, Jan Cornelis, Stoelinga, Mariëlle Ida Antoinette, Braberman, Victor, Fribourg, Laurent

Publikováno v: University of Twente Research Information (Pure Portal)
Lecture Notes in Computer Science ISBN: 9783642402289
FORMATS
Proceedings of the 11th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS), 243-257
STARTPAGE=243;ENDPAGE=257;TITLE=Proceedings of the 11th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS)

Markov automata are a novel formalism for specifying systems exhibiting nondeterminism, probabilistic choices and Markovian rates. Recently, the process algebra MAPA was introduced to efficiently model such systems. As always, the state space explosi

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::16f4411b84e9cfb93f53a7cb1de20373
https://research.utwente.nl/en/publications/fdcaa19a-65d8-4e39-820b-c3accb583035