Abstract
In contrast with the existing approaches to exact bisimulation for fuzzy systems, we introduce a robust notion of behavioral distance to measure the behavioral similarity of nondeterministic fuzzy-transition systems which are a generalization of fuzzy automata. This behavioral distance provides a quantitative analogue of bisimilarity and is defined as the greatest fixed point of a suitable monotonic function. The behavioral distance has the important property that two systems are at zero distance if and only if they are bisimilar. Moreover, for any given threshold, we find that systems with behavioral distances bounded by the threshold are equivalent. In addition, we show that two system combinators—parallel composition and product—are nonexpansive with respect to our behavioral distance, which makes compositional verification possible. The theory developed here is applicable to the quantitative verification, approximate reduction, and reliability analysis of fuzzy-transition systems. © 1993-2012 IEEE.
| Original language | English |
|---|---|
| Article number | 6362199 |
| Pages (from-to) | 735-747 |
| Journal | IEEE Transactions on Fuzzy Systems |
| Volume | 21 |
| Issue number | 4 |
| Online published | 27 Nov 2012 |
| DOIs | |
| Publication status | Published - Aug 2013 |
Research Keywords
- Behavioral distance
- bisimulation
- fuzzy automaton
- fuzzy-transition system (FTS)
- nonexpansiveness
- pseudo-ultrametric
Fingerprint
Dive into the research topics of 'A behavioral distance for fuzzy-transition systems'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver