Non-Deterministic Kleene Coalgebras

Alexandra Silva; Marcello Bonsangue; Jan Rutten

doi:10.2168/LMCS-6(3:23)2010

Alexandra Silva ; Marcello Bonsangue ; Jan Rutten - Non-Deterministic Kleene Coalgebras

lmcs:695 - Logical Methods in Computer Science, September 9, 2010, Volume 6, Issue 3 - https://doi.org/10.2168/LMCS-6(3:23)2010

Non-Deterministic Kleene CoalgebrasArticle

Authors: Alexandra Silva ; Marcello Bonsangue ; Jan Rutten

In this paper, we present a systematic way of deriving (1) languages of (generalised) 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.

https://doi.org/10.2168/LMCS-6(3:23)2010

Source: arXiv.org:1007.3769

Volume: Volume 6, Issue 3

Published on: September 9, 2010

Imported on: January 3, 2010

Keywords: Computer Science - Logic in Computer Science,F.3.1, F.3.2, F.4.1

Licence: arXiv.org - Non-exclusive license to distribute

Funding:

Source : OpenAIRE Graph