Computer Science – Artificial Intelligence
Scientific paper
2010-12-10
IEEE Trans. Fuzzy Syst., vol. 19, no. 3, pp. 540-552, 2011
Computer Science
Artificial Intelligence
13 double column pages
Scientific paper
There has been a long history of using fuzzy language equivalence to compare the behavior of fuzzy systems, but the comparison at this level is too coarse. Recently, a finer behavioral measure, bisimulation, has been introduced to fuzzy finite automata. However, the results obtained are applicable only to finite-state systems. In this paper, we consider bisimulation for general fuzzy systems which may be infinite-state or infinite-event, by modeling them as fuzzy transition systems. To help understand and check bisimulation, we characterize it in three ways by enumerating whole transitions, comparing individual transitions, and using a monotonic function. In addition, we address composition operations, subsystems, quotients, and homomorphisms of fuzzy transition systems and discuss their properties connected with bisimulation. The results presented here are useful for comparing the behavior of general fuzzy systems. In particular, this makes it possible to relate an infinite fuzzy system to a finite one, which is easier to analyze, with the same behavior.
Cao Yongzhi
Chen Guoqing
Kerre Etienne
No associations
LandOfFree
Bisimulations for fuzzy transition systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Bisimulations for fuzzy transition systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bisimulations for fuzzy transition systems will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-106429