Approximating Markovian testing equivalence

Abstract

Several approaches have been proposed to relax behavioral equivalences for fine-grain models including probabilities and time. All of them face two problems behind the notion of approximation, i.e. the lack of transitivity and the efficiency of the verification algorithm. While the typical equivalence under approximation is bisimulation, we present a… (More)
DOI: 10.1016/j.tcs.2011.07.019

Topics

1 Figure or Table

Slides referencing similar topics