Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

Approximating Markovian Testing Equivalence Alessandro Aldini

Summary: Approximating Markovian Testing Equivalence
Alessandro Aldini
University of Urbino, Italy
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 relaxation of Markovian
testing equivalence in a process algebraic framework. In this coarser setting,
we show that it is particularly intuitive to manage separately three different
dimensions of the approximation ­ execution time, event probability, and
observed behavior ­ by illustrating in each case results concerning the two
problems mentioned above. Finally, a unified definition combining the three
orthogonal aspects is provided in order to favor trade-off analyses.
Markovian testing equivalence, process algebra, approximate equivalence
1. Introduction
The comparison of system models through equivalence checking [7] is a
well-known approach to the analysis of systems of practical interest, ranging


Source: Aldini, Alessandro - Dipartimento di Matematica, Fisica e Informatica, Universita’ di Urbino "Carlo Bo"


Collections: Computer Technologies and Information Sciences