Stone-Kleene Relation Algebras

Walter Guttmann 🌐

July 6, 2017

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.

Abstract

We develop Stone-Kleene relation algebras, which expand Stone relation algebras with a Kleene star operation to describe reachability in weighted graphs. Many properties of the Kleene star arise as a special case of a more general theory of iteration based on Conway semirings extended by simulation axioms. This includes several theorems representing complex program transformations. We formally prove the correctness of Conway's automata-based construction of the Kleene star of a matrix. We prove numerous results useful for reasoning about weighted graphs.

License

BSD License

Topics

Session Stone_Kleene_Relation_Algebras

Depends on

Used by

Cite

× 
@article{Stone_Kleene_Relation_Algebras-AFP,
  author  = {Walter Guttmann},
  title   = {Stone-Kleene Relation Algebras},
  journal = {Archive of Formal Proofs},
  month   = {July},
  year    = {2017},
  note    = {\url{https://isa-afp.org/entries/Stone_Kleene_Relation_Algebras.html},
             Formal proof development},
  ISSN    = {2150-914x},
}
Download

Download

× Download latest

Older releases: