Non expansive ε-bisimulations

8Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

ε-bisimulation equivalence has been proposed in the literature as a technique to study the concept of behavioral distance between probabilistic processes. In this paper we consider also two stronger equivalences: action ε-bisimulation and global ε-bisimulation. For each of these three equivalence notions we propose an SOS transition rule format ensuring the property of non-expansiveness. Non-expansiveness means that if the behavioral distance between s i and t i is ε i , then the behavioral distance between f(s 1,...,s n ) and f(t 1,...,t n ) is no more that ε 1∈+∈...∈+∈ε n . As expected, the stronger the ε-bisimulation considered, the (slightly) weaker the constraints of the transition rule format. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Tini, S. (2008). Non expansive ε-bisimulations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5140 LNCS, pp. 362–376). https://doi.org/10.1007/978-3-540-79980-1_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free