Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Note on the Approximation of Weak Probabilistic Bisimulation
 

Summary: A Note on the Approximation of
Weak Probabilistic Bisimulation
Alessandro Aldini
Universit`a di Urbino "Carlo Bo", Istituto STI, Italy
Abstract
The need for flexible and formal approaches to the comparison of different pro-
cess models is motivated in several application domains and with respect to different
system properties. They can be helpful to compare a web service with some de-
sired qualitative/quantitative service description, to relate an implemented software
architecture to a reference dependable architectural model, and to reveal the per-
formability impact of one component over the whole system through the comparison
of the two system views that are obtained by activating/deactivating the compo-
nent (this is generally called noninterference analysis). As a further step towards the
flexibility of equivalence checking based techniques, we advocate an approach that
relies on an approximate notion of weak probabilistic bisimulation, through which
to provide a measure of the approximation and diagnostic information supporting
exact methods such as numerical analysis and state space minimization.
Comparing different process models is a frequently used approach to the
analysis of system requirements in practical application domains. In order to
bridge the gap between rigid equivalence checking techniques and more relaxed

  

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

 

Collections: Computer Technologies and Information Sciences