Coalgebras for Fuzzy Transition Systems
Hengyang Wu, Yixiang Chen
Abstract
Open-access reader
Hengyang Wu, Yixiang Chen
Abstract
Open-access reader
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.
OpenAlex reports 8 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Functor, Bisimulation, Coalgebra, Nondeterministic algorithm, Mathematics, Transition system, Fuzzy logic, Isomorphism (crystallography)