A Coalgebraic Approach to Kleene Algebra with Tests

Simple item page
dc.creatorChen, Hubie
dc.creatorPucella, Riccardo
dc.date2004-05-26
dc.date.accessioned2026-07-07T03:21:22Z
dc.date.available2026-07-07T03:21:22Z
dc.descriptionKleene 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.
dc.description21 pages, 1 figure; preliminary version appeared in Proc. Workshop on Coalgebraic Methods in Computer Science (CMCS'03)
dc.identifierhttps://arxiv.org/abs/cs/0405097
dc.identifierhttp://arxiv.org/abs/cs/0405097
dc.identifierTheoretical Computer Science, 327 (1-2), 23-44 (2004)
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32167
dc.subjectLogic in Computer Science
dc.subjectProgramming Languages
dc.subjectF.3.1;I.1.1;I.1.3
dc.titleA Coalgebraic Approach to Kleene Algebra with Tests
dc.typetext

Files

Collections

arXiv