site stats

Bisimulations for fuzzy transition systems

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 … WebAug 1, 2024 · We carry out a systematic investigation on this new notion of bisimulation. In particular, a fixed ...

Limited approximate bisimulations and the corresponding rough ...

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. byte sub filter https://oianko.com

Fuzzy simulations and bisimulations between fuzzy automata ...

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. 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 fundamental problems of the theory of FLTSs. This problem is of the same nature as computing the largest crisp simulation between two finite FLTSs. clotrimazole related compound a

Fuzzy simulations and bisimulations between fuzzy automata ...

Category:Logical characterizations of fuzzy bisimulations in fuzzy modal …

Tags:Bisimulations for fuzzy transition systems

Bisimulations for fuzzy transition systems

Bisimulations for non-deterministic labelled Markov processes

http://arxiv-export3.library.cornell.edu/pdf/2010.15671v3 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.

Bisimulations for fuzzy transition systems

Did you know?

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 …

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

WebFeb 1, 2024 · There are two kinds of bisimulation, namely crisp and fuzzy, between fuzzy structures such as fuzzy automata, fuzzy transition systems, fuzzy Kripke models and … 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].

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

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. byte sum x8WebBisimulations 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 … clotrimazole rxlist used forWebBisimulations 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. byte substring c#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 … bytes und buildingWebFeb 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 … clotrimazol erythrasmaWebAug 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. byte superioreWebJun 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). … bytesub 25