Lax Invariant in Coalgebra

@inproceedings{Li2008LaxII,
  title={Lax Invariant in Coalgebra},
  author={Jie-lin Li and Lei Fan},
  booktitle={ACFIE},
  year={2008}
}
In [1], Bart Jacobs and Jasse Hughes have brought in a new kind of functor. They took the order on a functor as a new functor. Based on that, they defined and researched some new notions about bisimulation. We take this new functor into the research of invariant in coalgebra, get the definition of predicate invariant, then we define and research several new notions. In the last, we can reach some conclusion about invariant. It is worth pointing out that we find the sufficient condition to make… 

References

SHOWING 1-10 OF 10 REFERENCES
Comprehension for Coalgebras
Toposes of Coalgebras and Hidden Algebras
Universal coalgebra: a theory of systems
On the structure of categories of coalgebras
Automata and Coinduction (An Exercise in Coalgebra)
The classical theory of deterministic automata is presented in terms of the notions of homomorphism and bisimulation, which are the cornerstones of the theory of (universal) coalgebra. This leads to
A Survey on the Coalgebraic Methods in Computer Science
TLDR
The recent progress of coalgebraic methods, including its basic concepts, categorical foundations, logical foundations and its applications, is summarized for raising the attention of the relative researchers.
Weak Invariant and Restrict Product of LTS
On the basis of references[1,2],the paper gives the definition of weak invariant,and discusses its characteristics and the relations between invariant and weak invariant. Besides,we introduce the
Simulations in Coalgebra
CONCUR'98 Concurrency Theory