Non-deterministic Kleene Coalgebras

Citation:
Silva A, Bonsangue M, Rutten J.  2010.  Non-deterministic Kleene Coalgebras. :1-39.

Report Date:

September

Report Number:

SEN 10-01

Abstract:

In this paper, we present a systematic way of deriving (1) languages of (generalized) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of systems. This generalizes both the results of Kleene (on regular languages and deterministic finite automata) and Milner (on regular behaviours and finite labelled transition systems), and includes many other systems such as Mealy and Moore machines.

Citation Key:

SBR10a
PreviewAttachmentSize
14942d.pdf1.1 MB