z-logo
open-access-imgOpen Access
Coalgebras for Fuzzy Transition Systems
Author(s) -
Hengyang Wu,
Yixiang Chen
Publication year - 2014
Publication title -
electronic notes in theoretical computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.242
H-Index - 60
ISSN - 1571-0661
DOI - 10.1016/j.entcs.2014.01.008
Subject(s) - functor , bisimulation , coalgebra , nondeterministic algorithm , mathematics , transition system , fuzzy logic , isomorphism (crystallography) , pure mathematics , algebra over a field , discrete mathematics , computer science , algorithm , artificial intelligence , crystal structure , chemistry , crystallography
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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom