Abstract
This paper studies a coalgebraic theory of fuzzy transition systems. Main conclusions include: the functor FA for deterministic fuzzy transition systems and the functor (P∘F)A for nondeterministic fuzzy transition systems preserve weak pullbacks, and the functor FA has a final coalgebra under some restricted conditions. Moreover, we show how to get a concrete (fuzzy) bisimulation from a coalgebraic bisimulation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have