Behavioural equivalences; Product-forms stochastic models; Quantitative analysis; Stochastic automata; Theoretical Computer Science; Information Systems; Computer Science Applications; Computer Vision and Pattern Recognition; Computational Theory and Mathematics

In this paper we consider two relations over stochastic automata, named lumpable bisimulation and exact equivalence, that induce a strong and an exact lumping, respectively, on the underlying Markov chains. We show that an exact equivalence over the …