Electronic Notes in Theoretical Computer Science · 2002 · 19 citations · 9 references
ComputingComputer ScienceMathematicsAlgebraFormal MethodsLogicCategory TheoryEquivalence CheckingModel TheoryBisimulationBisimulation AnalysisObservational EquivalenceWeak Bisimulation
This paper contains a novel approach to observational equivalence for coalgebras. We describe how to define weak homomorphisms, weak bisimulation, and investigate the connection between them as well as the relation to the known theory of bisimulation for coalgebras. The ultimate result of the paper is the correctness-proof for a weak coinduction proof principle.
9
Wojciech Penczek · Science of Computer Programming · 1990 · 4K citations
Universal coalgebra: a theory of systems
J.J.M.M. Rutten · Theoretical Computer Science · 2000 · 1.2K citations
On descriptive classification of set-functors. II.
Věra Trnková · Czech digital mathematics library · 1971 · 56 citations