n the literature devoted to the efficient solution of Continuous Time Markov Chains (CTMCs) the notions of lumpability and reversibility have a central role. In the con- text of lumpable Markov chains several definitions have been introduced: strong, exact and strict, just to mention a few of them. On the side of the analysis of reversible CTMCs the research community has shown great interest in the application of this notion with the aim of efficiently computing the stationary distribution of large models (e.g., obtained by composition of several processes). In this paper we show for the first time the relations between the above mentioned notions of lumpability and the concept of reversibility. The major outcome of our research is proving...
The concept of strong and weak lumpability between Markov chains was introduced by Burke and Rosenbl...
In this paper we reason about the notion of proportional lumpability, that generalizes the original ...
Performance evaluation of computer software or hardware architectures may rely on the analysis of a ...
n the literature devoted to the efficient solution of Continuous Time Markov Chains (CTMCs) the noti...
Abstract—In the literature devoted to the efficient solution of Continuous Time Markov Chains (CTMCs...
In the literature, the notions of lumpability and time reversibility for large Markov chains have be...
In this paper we consider two relations over stochastic automata, named lumpable bisimulation and ex...
The technique of lumping of Markov chains is one of the main tools for recovering from state explosi...
AbstractThe technique of lumping of Markov chains is one of the main tools for recovering from state...
This is the accompanying material for the draft with same title and authors of this repository. The...
The computation of the steady-state distribution of Continuous Time Markov Chains (CTMCs) may be a c...
Time reversibility plays an important role in the analysis of continuous and discrete time Markov ch...
In this thesis, the theory of lumpability (strong lumpability and weak lumpability) of irreducible f...
The assumption of perfect knowledge of rate parameters in continuous-time Markov chains (CTMCs) is u...
A class of Markov chains we call successively lumpable is specified for which it is shown that the s...
The concept of strong and weak lumpability between Markov chains was introduced by Burke and Rosenbl...
In this paper we reason about the notion of proportional lumpability, that generalizes the original ...
Performance evaluation of computer software or hardware architectures may rely on the analysis of a ...
n the literature devoted to the efficient solution of Continuous Time Markov Chains (CTMCs) the noti...
Abstract—In the literature devoted to the efficient solution of Continuous Time Markov Chains (CTMCs...
In the literature, the notions of lumpability and time reversibility for large Markov chains have be...
In this paper we consider two relations over stochastic automata, named lumpable bisimulation and ex...
The technique of lumping of Markov chains is one of the main tools for recovering from state explosi...
AbstractThe technique of lumping of Markov chains is one of the main tools for recovering from state...
This is the accompanying material for the draft with same title and authors of this repository. The...
The computation of the steady-state distribution of Continuous Time Markov Chains (CTMCs) may be a c...
Time reversibility plays an important role in the analysis of continuous and discrete time Markov ch...
In this thesis, the theory of lumpability (strong lumpability and weak lumpability) of irreducible f...
The assumption of perfect knowledge of rate parameters in continuous-time Markov chains (CTMCs) is u...
A class of Markov chains we call successively lumpable is specified for which it is shown that the s...
The concept of strong and weak lumpability between Markov chains was introduced by Burke and Rosenbl...
In this paper we reason about the notion of proportional lumpability, that generalizes the original ...
Performance evaluation of computer software or hardware architectures may rely on the analysis of a ...