Computer Science – Logic in Computer Science
Scientific paper
2004-05-26
Theoretical Computer Science, 327 (1-2), 23-44 (2004)
Computer Science
Logic in Computer Science
21 pages, 1 figure; preliminary version appeared in Proc. Workshop on Coalgebraic Methods in Computer Science (CMCS'03)
Scientific paper
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.
Chen Hubie
Pucella Riccardo
No associations
LandOfFree
A Coalgebraic Approach to Kleene Algebra with Tests does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Coalgebraic Approach to Kleene Algebra with Tests, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Coalgebraic Approach to Kleene Algebra with Tests will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-78854