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 Coalgebras

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.


    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
    Funding:
      Source : OpenAIRE Graph
    • SERVICE-ORIENTED COMPUTING: FOUNDATIONS AND CALCULI; Funder: Fundação para a Ciência e a Tecnologia, I.P.; Code: SFRH/BD/27482/2006

    Linked publications - datasets - softwares

    Source : ScholeXplorer IsReferencedBy ARXIV 1104.2803
    Source : ScholeXplorer IsReferencedBy DOI 10.1145/2422085.2422092
    Source : ScholeXplorer IsReferencedBy DOI 10.48550/arxiv.1104.2803
    Source : ScholeXplorer IsReferencedBy HANDLE 1822/35523
    Source : ScholeXplorer IsReferencedBy HANDLE 1887/59681
    Source : ScholeXplorer IsReferencedBy HANDLE 2066/111253
    • 2066/111253
    • 1887/59681
    • 10.48550/arxiv.1104.2803
    • 1104.2803
    • 2066/111253
    • 1887/59681
    • 1822/35523
    • 10.1145/2422085.2422092
    • 10.1145/2422085.2422092
    • 10.1145/2422085.2422092
    Sound and complete axiomatizations of coalgebraic language equivalence
    Bonsangue, M.M. ; Milius, S. ; Silva, A. ;

    11 Documents citing this article

    Consultation statistics

    This page has been seen 632 times.
    This article's PDF has been downloaded 220 times.