Abstract and concrete categories
Abstract and concrete categories
Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
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
Automata logics, and infinite games: a guide to current research
Automata logics, and infinite games: a guide to current research
On the final sequence of a finitary set functor
Theoretical Computer Science
Expressivity of coalgebraic modal logic: The limits and beyond
Theoretical Computer Science
Automata and fixed point logic: A coalgebraic perspective
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Bisimulation for neighbourhood structures
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Coinductive Predicates and Final Sequences in a Fibration
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
In this paper we provide an alternative proof of a fundamental theorem by Worrell stating that the (possibly infinite) behaviour of an F -coalgebra state can be faithfully approximated by the collection of its finite, n -step behaviours, provided that F :Set***Set is a finitary set functor. The novelty of our work lies in our proof technique: our proof uses a certain graph game that generalizes Baltag's F -bisimilarity game. Phrased in terms of games, our main technical result is that behavioural equivalence on F -coalgebras for a finitary set functor F can be captured by a two-player graph game in which at every position a player has only finitely many moves.