CoCasl [11], a recently developed coalgebraic extension of the algebraic specification language Casl [2], allows for modelling systems in terms of inductive datatypes as well as of co-inductive process types. Here, we demonstrate how to specify process algebras, namely CCS [10] and CSP [8,17], within such an algebraic-coalgebraic framework. It turns out that CoCasl can deal with the fundamental...

This paper is a study into some properties and applications of Moss’ coalgebraic or ‘cover’ modality ∇. First we present two axiomatizations of this operator, and we prove these axiomatizations to be sound and complete with respect to basic modal and positive modal logic, respectively. More precisely, we introduce the notions of a modal ∇-algebra and of a positive modal ∇-algebra. We establish ...

The area of automata learning was pioneered by Angluin in the 80’s [1]. Her original algorithm, which applied to regular languages and deterministic automata, has been extended to various types of automata and used in software and hardware verification. In this talk, we will take an abstract perspective at automata learning. We show how the correctness of the original algorithm and many extensi...