| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 422804 | Electronic Notes in Theoretical Computer Science | 2014 | 11 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
