Asynchronous test equivalence for probabilistic processes

In this paper, we propose a new semantic equivalence over the set of probabilistic processes. This equivalence is defined by means of asynchronous testing. We show that each probabilistic process exhibits a certain input-output behaviour when subjected to asynchronous testing. Two processes are said to be semantically equivalent when they exhibit the same behaviour. There already exists a notion of semantic equivalence defined through synchronous testing. We finally draw comparison between the equivalence proposed by us and the existing equivalence.