31 March - 1 April 2012, 11th International Workshop on Coalgebraic Methods in Computer Science (CMCS 2012), Tallinn, Estonia

In more than a decade of research, it has been established that a wide variety of state-based dynamical systems, like transition systems, automata (including weighted and probabilistic variants), Markov chains, and game-based systems, can be treated uniformly as coalgebras. Coalgebra has developed into a field of its own interest presenting a deep mathematical foundation, a growing field of applications, and interactions with various other fields such as reactive and interactive system theory, object-oriented and concurrent programming, formal system specification, modal and description logics, artificial intelligence, dynamical systems, control systems, category theory, algebra, analysis, etc. The aim of the CMCS workshop series is to bring together researchers with a common interest in the theory of coalgebras, their logics, and their applications.

For more information, see http://www.coalg.org/cmcs12/