2024 Bisimulations for fuzzy-transition systems

Bisimulations for fuzzy-transition systems

Author: rlkd

August undefined, 2024

WebAug 1, 2024 · There are two kinds of bisimulations and simulations, namely, crispand fuzzy, for fuzzy graph-based structures such as FLTSs, fuzzy automata, fuzzy/weighted social networks, fuzzy Kripke models and fuzzy interpretations in description logic. They have been studied by a considerable number of researchers. WebSep 6, 2024 · share 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.

Bisimulations for fuzzy transition systems revisited

WebSimulations and bisimulations are known to be useful for abstracting and comparing formal systems, and they have recently been introduced into fuzzy systems. In this study, we … WebJul 18, 2024 · A fuzzy bisimulation between a fuzzy structure G and itself is called a fuzzy auto-bisimulation of G. The greatest fuzzy auto-bisimulation of an image-finite fuzzy graph-based structure is a fuzzy equivalence relation. It is useful for classification and clustering. twn4 elatec

Computing crisp simulations for fuzzy labeled transition systems

WebJun 1, 2011 · Recently, a finer behavioral measure, i.e., bisimulation, has been introduced to fuzzy-finite automata. However, the results obtained are applicable only to finite-state … http://arxiv-export3.library.cornell.edu/pdf/2010.15671v3 WebMar 1, 2024 · In order to study the (bi)simulation semantics of labeled fuzzy transition systems in the residuated lattice-valued logic setting, we introduce an extension of labeled approximation spaces, called the quantitative fuzzy approximation spaces (QFASs), whose labels are equipped with a residuated lattice-valued equality relation. twn4 devpack

Fuzzy simulations and bisimulations between fuzzy automata ...

WebThis 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. 63 PDF Bisimulations for fuzzy automata 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]. twn4 driverWebBisimulations for fuzzy-transition systems. Y Cao, G Chen, EE Kerre. IEEE Transactions on Fuzzy Systems 19 (3), 540-552, 2011. 81: ... IEEE Transactions on Fuzzy Systems 15 (6), 1238-1250, 2007. 44: 2007: Model checking fuzzy computation tree logic. H Pan, Y Li, Y Cao, Z Ma. Fuzzy Sets and Systems 262, 60-77, 2015. 34: talent show decorations for sale

"WebJun 1, 2011 · Bisimulations for Fuzzy-Transition Systems Computing methodologies Artificial intelligence Knowledge representation and reasoning Probabilistic reasoning Vagueness and fuzzy logic Mathematics of computing Discrete mathematics Theory of computation Formal languages and automata theory Models of computation Comments " - Bisimulations for fuzzy-transition systems

Bisimulations for fuzzy-transition systems

CAO, CHEN, AND KERRE: BISIMULATIONS FOR …

WebAug 1, 2024 · There are two kinds of bisimulations and simulations, namely, crisp and fuzzy, for fuzzy graph-based structures such as FLTSs, fuzzy automata, fuzzy/weighted … WebSep 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 …

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

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. WebIn this article, we design an efficient algorithm with the complexity O ( (m + n) n) for computing the largest crisp simulation between two finite FLTSs. This gives a significant …

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]. Webbisimulation for general fuzzy systems which may be inﬁnite-state or inﬁnite-event. To this end, we model fuzzy systems as fuzzy transition systems (FTSs) and deﬁne …

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 …

WebDec 7, 2024 · Fuzzy Bisimulations for Nondeterministic Fuzzy Transition Systems Abstract: Bisimulations are established forms of behavioral equivalences for discrete … twn4 firmwareWebAbstract: 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. talent show deathsWebDec 1, 2012 · A robust notion of behavioral distance is introduced to measure the behavioral similarity of nondeterministic fuzzy-transition systems which are a generalization of fuzzy automata and it is shown that two system combinators-parallel composition and product-are nonexpansive with respect to this behavioral distance, which makes compositional … talent show decorations party cityWebBisimulation is a well-known behavioral equivalence for discrete event systems, and has recently been adopted and developed in fuzzy systems. In this paper, we propose a … twn4 multitech desktopWebComputing behavioural distance for fuzzy transition systems Abstract: The 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. talent show definitionWebDec 9, 2010 · In this paper, we consider bisimulation for general fuzzy systems which may be infinite-state or infinite-event, by modeling them … twn4 multitech smartcardWebAug 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. talent show death metal