Zobrazeno 1 - 10
of 62
pro vyhledávání: '"Siegle, Markus"'
Autor:
Michel, Fabian, Siegle, Markus
We study the approximation of a Markov chain on a reduced state space, for both discrete- and continuous-time Markov chains. In this context, we extend the existing theory of formal error bounds for the approximated transient distributions. As a spec
Externí odkaz:
http://arxiv.org/abs/2403.07618
Autor:
Siegle, Markus, Soltanieh, Amin
This report presents an algorithm for determining the unknown rates in the sequential processes of a Stochastic Process Algebra model, provided that the rates in the combined flat model are given. Such a rate lifting is useful for model reengineering
Externí odkaz:
http://arxiv.org/abs/2206.14505
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
EPTCS 220, 2016, pp. 77-89
This paper presents algorithms for identifying and reducing a dedicated set of controllable transition rates of a state-labelled continuous-time Markov chain model. The purpose of the reduction is to make states to satisfy a given requirement, specif
Externí odkaz:
http://arxiv.org/abs/1608.00658
Autor:
Soltanieh, Amin, Siegle, Markus
Publikováno v:
In Electronic Notes in Theoretical Computer Science 1 November 2020 353:129-148
Autor:
Schuster, Johann, Siegle, Markus
Publikováno v:
EPTCS 140, 2014, pp. 1-15
The paper shows that there is a deep structure on certain sets of bisimilar Probabilistic Automata (PA). The key prerequisite for these structures is a notion of compactness of PA. It is shown that compact bisimilar PA form lattices. These results ar
Externí odkaz:
http://arxiv.org/abs/1402.6782
Autor:
Siegle, Markus.
Erlangen, Nürnberg, University, Habilitation, 2002.
Externí odkaz:
http://books.google.com/books?id=xgJTAAAAMAAJ
Publikováno v:
In Performance Evaluation April 2019 130:32-50
Autor:
Schuster, Johann, Siegle, Markus
This paper develops a decision algorithm for weak bisimulation on Markov Automata (MA). For that purpose, different notions of vanishing state (a concept known from the area of Generalised Stochastic Petri Nets) are defined. Vanishing states are show
Externí odkaz:
http://arxiv.org/abs/1205.6192
Autor:
Schuster, Johann, Siegle, Markus
Publikováno v:
In Information and Computation October 2014 237:151-173