BIROn - Birkbeck Institutional Research Online

    A coalgebraic approach to Kleene algebra with tests

    Chen, Hubie and Pucella, R. (2003) A coalgebraic approach to Kleene algebra with tests. Electronic Notes in Theoretical Computer Science 82 (1), pp. 94-109. ISSN 1571-0661.

    Full text not available from this repository.

    Abstract

    Kleene Algebra with Tests is an extension of Kleene Algebra, the algebra of regular expressions, which can be used to reason about programs. We develop a coalgebraic theory of Kleene Algebra with Tests, along the lines of the coalgebraic theory of regular expressions based on deterministic automata. Since the known automata-theoretic presentation of Kleene Algebra with Tests does not lend itself to a coalgebraic theory, we define a new interpretation of Kleene Algebra with Tests expressions and a corresponding automata-theoretic presentation. One outcome of the theory is a coinductive proof principle, that can be used to establish equivalence of our Kleene Algebra with Tests expressions.

    Metadata

    Item Type: Article
    School: School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Sarah Hall
    Date Deposited: 09 Mar 2021 17:40
    Last Modified: 09 Mar 2021 17:40
    URI: https://eprints.bbk.ac.uk/id/eprint/43362

    Statistics

    Downloads
    Activity Overview
    0Downloads
    10Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item