We show that coinductive predicates expressing behavioural properties of infinite objects can be themselves expressed as final coalgebras in a category of relations. The well-known case of bisimulation will simply be a special case of such final predicates. We will show how some useful pointwise and mixed properties of streams can be modelled in this way.
Additional Metadata
MSC Rings and algebras with additional structure (msc 16Wxx), Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (msc 68Q85)
THEME Software (theme 1)
Publisher Institute of Cybernetics at Tallinn University of Technology
Editor R. Matthes , T. Uustalu
Project Mending the Unending: Machine Assisted Reasoning with Infinite Objects
Conference Workshop on Fixed Points in Computer Science
Citation
Niqui, M, & Rutten, J.J.M.M. (2009). Coinductive Predicates as Final Coalgebras. In R Matthes & T Uustalu (Eds.), 6th Workshop on Fixed Points in Computer Science, FICS 2009, Coimbra, Portugal, 12--13 September 2009. Proceedings. (pp. 79–85). Institute of Cybernetics at Tallinn University of Technology.