Bisimulations for fuzzy transition systems

Author: gajb

August undefined, 2024

WebCAO, CHEN, AND KERRE: BISIMULATIONS FOR FUZZY TRANSITION SYSTEMS 1 Bisimulations for Fuzzy Transition Systems Yongzhi Cao, Guoqing Chen, and … WebThere are two kinds of bisimulation, namely crisp and fuzzy, between fuzzy structures such as fuzzy automata, fuzzy labeled transition systems, fuzzy Kripke models and fuzzy interpretations in description logics. Fuzzy bisimulations between fuzzy automata over a complete residuated lattice have been introduced by Ćirić et al. in 2012.

[1012.2148] Bisimulations for fuzzy transition systems - arXiv.org

WebMay 15, 2012 · For example, Cao et al. [2,4] considered bisimulations for fuzzy transition systems (FTS) where both fuzzy transitions and nondeterministic transitions co-exist. This model is further studied under fuzzy automata by Cao et al. [3] and Pan et al. [15]. Ćirić et al. [5] investigated bisimulations for fuzzy automata. data structures using c reema thareja

Bisimulations for Fuzzy Transition Systems revisited

WebDec 10, 2010 · 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 … WebDec 10, 2010 · Title: Bisimulations for fuzzy transition systems. Authors: Yongzhi Cao, Guoqing Chen, Etienne Kerre. Download PDF Abstract: 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, … Webspecial type of fuzzy modal logic – fuzzy description logics (cf. [19, 20, 23, 32, 38–43, 61]). Note also that the logical characterizations of the Hennessy-Milner type for bisimulations between fuzzy social networks and fuzzy labelled transition systems have been provided in [21, 22, 62, 63]. data structures using c by balagurusamy

Computing Crisp Bisimulations for Fuzzy Structures

Characterizing Crisp Simulations and Crisp Directed

WebThe behavioural distance is a more robust way of formalising behavioural similarity between states than bisimulations. The smaller the distance, the more alike the states are. It is helpful for quantitative verifications of concurrent systems. The main contribution of this paper is an effective procedure for computing behavioural distance introduced by Cao et … WebAug 1, 2024 · We carry out a systematic investigation on this new notion of bisimulation. In particular, a fixed point characterization of the group-by-group fuzzy bisimilarity is given, based on which, we provide a polynomial-time algorithm to check whether two states in a fuzzy transition system are group-by-group fuzzy bisimilar. bittern hollow austin tx 78758http://arxiv-export3.library.cornell.edu/pdf/2010.15671v3 bittern house walberswick

"WebJun 1, 2011 · 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 (FTSs). … " - Bisimulations for fuzzy transition systems

Bisimulations for fuzzy transition systems

Fuzzy simulations and bisimulations between fuzzy automata ...

WebApr 1, 2024 · [23] Nguyen L., Computing crisp simulations for fuzzy labeled transition systems, J. Intell. Fuzzy Syst. 42 (2024) 3067 – 3078, 10.3233/JIFS-210792. Google … WebE-mail: [email protected] . Abstract: The problem of checking whether a state in a finite fuzzy labeled transition system (FLTS) crisply simulates another is one of the fundamental problems of the theory of FLTSs. This problem is of the same nature as computing the largest crisp simulation between two finite FLTSs.

Did you know?

WebFuzzy structures such as fuzzy automata, fuzzy transition systems, weighted social net-works and fuzzy interpretations in fuzzy description logics have been widely studied. For such structures, bisimulation is a natural notion for characterizing indiscernibility between states or individuals. There are two kinds of bisimulations for fuzzy ... WebDec 7, 2024 · Bisimulations are established forms of behavioral equivalences for discrete event systems. Recently, bisimulations have been introduced to fuzzy transition …

WebBisimulations for Fuzzy-Transition Systems. This paper considers bisimulation for general fuzzy systems, which may be infinite state or infinite event, by modeling them as fuzzy-transition systems (FTSs), and characterize it in three ways by enumerating whole transitions, comparing individual transitions, and using a monotonic function. WebAug 1, 2024 · We carry out a systematic investigation on this new notion of bisimulation. In particular, a fixed ...

WebJul 15, 2024 · The use of specific fuzzy similarity measures depends on concrete fuzzy sets. Bisimulations are binary relations, which are generally considered as one of the most important contributions in many areas of computer sciences to not only model equivalence between discrete event systems such as Petri nets, transition systems, and automata … WebAug 1, 2024 · They have been studied by a considerable number of researchers. Related works that introduce bisimulations and simulations for fuzzy graph-based structures or …

WebDec 9, 2010 · Fuzzy transition systems are a natural generalization of labeled transition systems and can be thought of as weighted graphs, …

WebE-mail: [email protected] . Abstract: The problem of checking whether a state in a finite fuzzy labeled transition system (FLTS) crisply simulates another is one of the … bittern hollow condosWebBisimulations for fuzzy transition systems revisited. Bisimulations for fuzzy transition systems revisited. Yixiang Chen. 2024, International Journal of Approximate Reasoning. See Full PDF Download PDF. See Full PDF Download PDF. Related Papers. INFINITY 2002. Model checking birth and death. data structures using c projectsWebJul 18, 2024 · Fuzzy graphs are used as fuzzy labeled transition systems (FLTSs), fuzzy automata, fuzzy Kripke models and fuzzy interpretations in fuzzy description logics. For example, in the terminology of FLTSs, vertices, edges, edge labels and vertex labels represent states, transitions, actions and atomic properties of states, respectively. bittern house teignmouthWebThis article defines crisp bisimulations for a large class of FDLs with a rich set of well-known concept and role constructors, including qualified/unqualified number restrictions, nominals and the role constructor that correspond to the program constructors of propositional dynamic logic. Fuzzy description logics (FDLs) are useful for dealing with … bittern horningWebBisimulations for Fuzzy-Transition Systems. Bisimulations for Fuzzy-Transition Systems. Yongzhi Cao Etienne Kerre. 2000, IEEE Transactions on Fuzzy Systems. See Full PDF Download PDF. See Full PDF … data structures using c reema thareja pdfWebFeb 22, 2011 · There has been a long history of using fuzzy-language equivalence to compare the behavior of fuzzy systems; however, the comparison at this level is too … bittern house gatesheadWebSep 26, 2011 · Distribution-Based Behavioral Distance for Nondeterministic Fuzzy Transition Systems. IEEE Transactions on Fuzzy Systems, Vol. 26, Issue. 2, p. 416. ... Yixiang Bu, Tianming and Deng, Yuxin 2024. Algorithmic and logical characterizations of bisimulations for non-deterministic fuzzy transition systems. Fuzzy Sets and … bittern information point