Bisimulations for fuzzy transition systems revisited

Abstract Bisimulation 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 new bisimulation, i.e., the group-by-group fuzzy bisimulation, for fuzzy transition systems. It relaxes the fully matching requirement of the bisimulation definition proposed by Cao et al. (2010) [2] , and can equate more pairs of states which are deemed to be equivalent intuitively, but which cannot be equated in previous definitions. 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. Moreover, a modal logic, which is an extension of the Hennessy–Milner logic, is presented to completely characterize the group-by-group fuzzy bisimilarity.

[1]  Brian A. Davey,et al.  An Introduction to Lattices and Order , 1989 .

[2]  Hongyan Xing,et al.  Analysis and control of fuzzy discrete event systems using bisimulation equivalence , 2012, Theor. Comput. Sci..

[3]  Weilin Deng,et al.  Supervisory Control of Fuzzy Discrete-Event Systems for Simulation Equivalence , 2015, IEEE Transactions on Fuzzy Systems.

[4]  Miroslav Ciric,et al.  Computation of the greatest simulations and bisimulations between fuzzy automata , 2011, Fuzzy Sets Syst..

[5]  Miroslav Ciric,et al.  Bisimulations for weighted automata over an additively idempotent semiring , 2014, Theor. Comput. Sci..

[6]  Huaiqing Wang,et al.  A Behavioral Distance for Fuzzy-Transition Systems , 2011, IEEE Transactions on Fuzzy Systems.

[7]  Yongzhi Cao,et al.  Model checking computation tree logic over finite lattices , 2016, Theor. Comput. Sci..

[8]  Ping Li,et al.  Nondeterministic fuzzy automata with membership values in complete residuated lattices , 2017, Int. J. Approx. Reason..

[9]  Tuan-Fang Fan,et al.  Fuzzy Bisimulation for Gödel Modal Logic , 2015, IEEE Transactions on Fuzzy Systems.

[10]  Yixiang Chen,et al.  Algorithmic and logical characterizations of bisimulations for non-deterministic fuzzy transition systems , 2018, Fuzzy Sets Syst..

[11]  Miroslav Ciric,et al.  Bisimulations for fuzzy automata , 2011, Fuzzy Sets Syst..

[12]  Rocco De Nicola,et al.  Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes , 2015, Acta Informatica.

[13]  Hengyang Wu,et al.  Distribution-Based Behavioral Distance for Nondeterministic Fuzzy Transition Systems , 2018, IEEE Transactions on Fuzzy Systems.

[14]  Orna Kupferman,et al.  Latticed Simulation Relations and Games , 2007, ATVA.

[15]  Yongming Li,et al.  Quantitative Computation Tree Logic Model Checking Based on Generalized Possibility Measures , 2014, IEEE Transactions on Fuzzy Systems.

[16]  Yongming Li,et al.  Model Checking of Linear-Time Properties Based on Possibility Measure , 2012, IEEE Transactions on Fuzzy Systems.

[17]  Yongzhi Cao,et al.  Nondeterministic fuzzy automata , 2010, Inf. Sci..

[18]  Yuxin Deng,et al.  Logical characterizations of simulation and bisimulation for fuzzy transition systems , 2016, Fuzzy Sets Syst..

[19]  Etienne E. Kerre,et al.  Bisimulations for Fuzzy-Transition Systems , 2010, IEEE Transactions on Fuzzy Systems.

[20]  M. Ćiri,et al.  Computation of the greatest simulations and bisimulations between fuzzy automata , 2012 .