DeepAI AI Chat
Log In Sign Up

Bisimulations for fuzzy transition systems

by   Yongzhi Cao, et al.

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.


page 1

page 2

page 3

page 4


A Behavioral Distance for Fuzzy-Transition Systems

In contrast to the existing approaches to bisimulation for fuzzy systems...

On Typical Hesitant Fuzzy Languages and Automata

The idea of nondeterministic typical hesitant fuzzy automata is a genera...

Trace semantics via determinization for probabilistic transition systems

A coalgebraic definition of finite and infinite trace semantics for prob...

Modeling Fuzzy Cluster Transitions for Topic Tracing

Twitter can be viewed as a data source for Natural Language Processing (...

Bisimulations for fuzzy automata

Bisimulations have been widely used in many areas of computer science to...

Opacity of nondeterministic transition systems: A (bi)simulation relation approach

In this paper, we propose several opacity-preserving (bi)simulation rela...