In this note, we define bisimulation for BL-general fuzzy automata and show that if there is a bisimulation between two BL-general fuzzy automata, then they have the same behavior.For a given BL-general fuzzy automata, we obtain the greatest bisimulation for the BL-general fuzzy automata. Thereafter, if we use the greatest bisimulation, then we obtain a quotient BL-general fuzzy automata and th...

Taking into account the notion of BL-general fuzzy automaton, in the present study we define the notation of BL-intuitionistic general L-fuzzy automaton and I-bisimulation for BL-intuitionistic general L-fuzzy automaton.Then for a given BL-intuitionistic general L-fuzzy automaton, we obtain the greatest I-bisimulation. According to this notion, we give the structure of quotient BL-intuiti...

We introduce a class of neighbourhood frames for graded modal logic using an operation from Kripke to frames. This is shown be first-order definable but not modally definable. also obtain new definition bisimulation by modifying the monotonic bisimulation.

Abstract We investigate how various forms of bisimulation can be characterised using the technology logical relations. The approach taken is that each form corresponds to an algebraic structure derived from a transition system, and general result relation R between two systems on state spaces S T if only structures are in automatically generated . show this works for original Park–Milner it ext...