Coalgebraic Methods in Computer Science

This book constitutes the thoroughly refereed post-proceedings of the 12th International Workshop on Coalgebraic Methods in Computer Science, CMCS 2014, colocated with ETAPS 2014, held in Grenoble, France, in April 2014. The 10 revised full papers were carefully reviewed and selected from 20 submissions. Also included are three invited talks. The papers cover a wide range of topics in the theory, logics and applications of coalgebras.

Includes supplementary material: sn.pub/extras

Inhalt
Higher-Order Languages: Bisimulation and Coinductive Equivalences (Extended Abstract).- Generic Weakest Precondition Semantics from Monads Enriched with Order.- Coalgebraic Multigames.- How to Kill Epsilons with a Dagger.- On Coalgebras with Internal Moves.- A Coalgebraic View of Characteristic Formulas in Equational Modal Fixed Point Logics.- Coalgebraic Simulations and Congruences.- Dijkstra Monads in Monadic Computation.- Categories of Coalgebras with Monadic Homomorphisms.- Lifting Adjunctions to Coalgebras to (Re)Discover Automata Constructions.- Canonical Nondeterministic Automata.- Towards Systematic Construction of Temporal Logics for Dynamical Systems via Coalgebra.- AlgebraicCoalgebraic Recursion Theory of History-Dependent Dynamical System Models.