Coalgebras for Fuzzy Transition Systems

Authors:
Hengyang Wu;Yixiang Chen
Affiliations:
Information Engineer College, Hangzhou Dianzi University, Hangzhou, 310018, China;MoE Engineering Research Center for Software/Hardware Co-design Technology and Application, Shanghai Key Lab for Trustworthy Computing, East China Normal University, Shanghai 200062, China
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2014

Citing 9
Cited 0

Bisimulation for probabilistic transition systems: a coalgebraic approach

Theoretical Computer Science
Universal coalgebra: a theory of systems

Theoretical Computer Science - Modern algebra and its applications
A Final Coalgebra Theorem

Category Theory and Computer Science
Stochastic Coalgebraic Logic

Stochastic Coalgebraic Logic
Bisimulations for fuzzy automata

Fuzzy Sets and Systems
Nondeterministic fuzzy automata

Information Sciences: an International Journal
Bisimulations for Fuzzy-Transition Systems

IEEE Transactions on Fuzzy Systems
Analysis and control of fuzzy discrete event systems using bisimulation equivalence

Theoretical Computer Science
Fuzzy relation equations and subsystems of fuzzy transition systems

Knowledge-Based Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies a coalgebraic theory of fuzzy transition systems. Main conclusions include: the functor F^A for deterministic fuzzy transition systems and the functor (P@?F)^A for nondeterministic fuzzy transition systems preserve weak pullbacks, and the functor F^A has a final coalgebra under some restricted conditions. Moreover, we show how to get a concrete (fuzzy) bisimulation from a coalgebraic bisimulation.