Bisimulations for fuzzy-transition systems

Author: eogc

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. WebFeb 22, 2011 · Bisimulations for Fuzzy-Transition Systems. Abstract: There has been a long history of using fuzzy-language equivalence to compare the behavior of fuzzy …

CAO, CHEN, AND KERRE: BISIMULATIONS FOR …

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 … 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]. graph tech canada

Fuzzy simulations and bisimulations between fuzzy automata ...

WebAug 1, 2024 · Bisimulation is a well-known behavioral equivalence for discrete event systems, and has recently been adopted and developed in fuzzy systems. In this paper, … WebRecently, bisimulations have been developed in fuzzy systems as well. For example, Cao et al. [2,4] considered bisimula-tions 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]. Ciri 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 … graphtech black tusq xl

Computing crisp simulations for fuzzy labeled transition systems

‪Yongzhi Cao (曹永知)‬ - ‪Google Scholar‬

WebDec 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 … 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 … graphtech camerasWebComputing 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. chiswick community centre

"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. " - Bisimulations for fuzzy-transition systems

Bisimulations for fuzzy-transition systems

Nondeterministic fuzzy automata - ScienceDirect

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

Did you know?

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 …

WebDec 9, 2010 · In this paper, we consider bisimulation for general fuzzy systems which may be infinite-state or infinite-event, by modeling them … WebBisimulation is a well-known behavioral equivalence for discrete event systems and has been developed in fuzzy systems quickly. In this paper, we adopt an approach of the …

WebFeb 1, 2024 · There are two kinds of bisimulation, namely crisp and fuzzy, between fuzzy structures such as fuzzy automata, fuzzy labeled transition systems, fuzzy Kripke … http://arxiv-export3.library.cornell.edu/pdf/2010.15671v3

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 …

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 Scholar Digital Library [24] Nguyen L., Logical characterizations of fuzzy bisimulations in fuzzy modal logics over residuated lattices, Fuzzy Sets Syst. 431 (2024) 70 – 93, … chiswick computersWebSep 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 … chiswick community hallWebJun 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 graphtech catalogWebThere 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. graphtech bass tunersWebDec 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 … graph tech cortlandWebFuzzy 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 ... chiswick companyWebThis 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 … chiswick community garden