A coalgebraic approach to Kleene algebra with tests

From MaRDI portal
Revision as of 09:56, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:703519

DOI10.1016/J.TCS.2004.07.020zbMATH Open1071.68073arXivcs/0405097OpenAlexW2102823559MaRDI QIDQ703519FDOQ703519

Riccardo Pucella, Hubie Chen

Publication date: 11 January 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/cs/0405097





Cites Work


Cited In (5)






This page was built for publication: A coalgebraic approach to Kleene algebra with tests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703519)