Coalgebraic models of computation

This group Coalgebraic models of computation (SEN3.3) is a subgroup of the research group Coordination Languages (SEN3).

Coordinator of Coalgebraic models of computation: Jan Rutten

Coalgebra offers a unifying mathematical framework for various state-based behavioural systems and (component-based and service-oriented) programming paradigms.

Ongoing activities include the development of coalgebraic and logical formalisms for various types of circuits including signal flow graphs and digital ciruits. Plans for 2007 include the implementation of algorithms derived from these formalisms; a study of a systematic coalgebraic treatment of finite representations of infinite structures; a unified final coalgebra semantics of both linear and non-linear systems; the study of behavioural differential equations for bi-infinite streams and binary trees.

Key publications

  • J.J.M.M. Rutten, Universal coalgebra: a theory of systems. In Theoretical Computer Science , 249(1), pp. 3-80, 2000.
  • J.J.M.M. Rutten, A coinductive calculus of streams. In Mathematical Structures in Computer Science , Vol. 15, pp. 93-147, 2005. J.L. Fiadeiro, J.J.M.M. Rutten, editors, Algebra and Coalgebra in Computer Science. In Special issue of Theoretical Computer Science, Vol. 366(1-2), pp. 1-180, 2006.
  • F. Arbab, C. Baier, M. Sirjani, J.J.M.M. Rutten, Modeling component connectors in Reo by constraint automata. In Science of Computer Programming, Vol. 61(2), pp. 75-113, 2006.

Projects