Bisimulations for fuzzy transition systems

WebBisimulations 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. 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].

Bisimulations for Fuzzy Transition Systems revisited

WebAug 16, 2014 · These concepts generalize the notions of simulations and bisimulations for fuzzy automata . The notions of weak simulations and bisimulations were used in a different context in the study of labeled transition systems with ε-transitions (or silent transitions). However, these concepts differ from our weak simulations and bisimulations. WebSep 6, 2024 · We formulate and prove logical characterizations of crisp simulations and crisp directed simulations between fuzzy labeled transition systems with respect to fuzzy modal logics that use a general t-norm-based semantics. The considered logics are fragments of the fuzzy propositional dynamic logic with the Baaz projection operator. small cushion stools walmart https://rsglawfirm.com

Characterizing Crisp Simulations and Crisp Directed ... - DeepAI

WebFeb 26, 2011 · Bisimulations have been extensively studied in the literature of fuzzy sets, including fuzzy automata [5, 12, 13,32,41,52,63,68,72], fuzzy discrete event systems … 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 … 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 characterize them in logic are discussed below. In [4] Cao et al. introduced and studied crisp bisimulations for fuzzy transition systems (FTSs). They gave results on composition ... sonamemon

Characterizing Crisp Simulations and Crisp Directed ... - DeepAI

Category:Computing behavioural distance for fuzzy transition systems

Tags:Bisimulations for fuzzy transition systems

Bisimulations for fuzzy transition systems

Computing crisp simulations for fuzzy labeled transition systems

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 … WebOct 27, 2024 · Fuzzy structures such as fuzzy automata, fuzzy transition systems, weighted social networks 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 …

Bisimulations for fuzzy transition systems

Did you know?

WebDec 9, 2010 · Fuzzy transition systems are a natural generalization of labeled transition systems and can be thought of as weighted graphs, … 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, …

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 … 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 …

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. WebFor fuzzy structures like fuzzy automata and fuzzy labeled transition systems (FLTSs), researchers have studied both crisp simulations [7]–[11] and fuzzy simulations [8], [12]–[15]. Crisp/fuzzy bisimulations have also been studied for fuzzy structures by a considerable number of researchers [7], [9], [12], [14], [16]–[26].

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.

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 … sonam fabricationWebMay 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. small custard bowlshttp://arxiv-export3.library.cornell.edu/pdf/2010.15671v3 sona mens watchesWebApr 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 … small cusrom homes cheapWebJun 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). To help understand and check bisimulation, we characterize it in three ways by enumerating whole transitions, comparing individual transitions, and using a monotonic function. sona merchandiseWebFuzzy 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 ... sona med spa coolsculpting reviewsWebMar 1, 2024 · Labeled transition systems or labeled directed graphs are the main structures on which bisimulations have been studied. Recently, bisimulation techniques have been introduced to fuzzy automata or, more generally, fuzzy systems (fuzzy directed graphs) [7], [8], [13], [41], [55], [56]. small cushions ikea