Pous, Damien
On the Positive Calculus of Relations with Transitive Closure
Abstract
Binary relations are such a basic object that they appear in many
places in mathematics and computer science. For instance, when
dealing with graphs, program semantics, or termination guarantees,
binary relations are always used at some point.
In this survey, we focus on the relations themselves, and we
consider algebraic and algorithmic questions. On the algebraic side, we want to understand and characterise the laws governing the behaviour of the following standard operations on relations: union, intersection, composition, converse, and reflexivetransitive closure. On the algorithmic side, we look for decision procedures for equality or inequality of relations.
After having formally defined the calculus of relations, we recall
the existing results about two wellstudied fragments of particular importance: Kleene algebras and allegories. Unifying those fragments yields a decidable theory whose axiomatisability remains an open problem.
BibTeX  Entry
@InProceedings{pous:LIPIcs:2018:8538,
author = {Damien Pous},
title = {{On the Positive Calculus of Relations with Transitive Closure}},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)},
pages = {3:13:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {9783959770620},
ISSN = {18688969},
year = {2018},
volume = {96},
editor = {Rolf Niedermeier and Brigitte Vall{\'e}e},
publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8538},
URN = {urn:nbn:de:0030drops85382},
doi = {10.4230/LIPIcs.STACS.2018.3},
annote = {Keywords: Relation Algebra, Kleene Algebra, Allegories, Automata, Graphs}
}
2018
Keywords: 

Relation Algebra, Kleene Algebra, Allegories, Automata, Graphs 
Seminar: 

35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)

Issue date: 

2018 
Date of publication: 

2018 