HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Algebras of Relations : from algorithms to formal proofs

Abstract : Algebras of relations appear naturally in many contexts, in computer science as well as in mathematics. They constitute a framework well suited to the semantics of imperative programs. Kleene algebra are a starting point: these algebras enjoy very strong decidability properties, and a complete axiomatisation. The goal of this thesis was to export known results from Kleene algebra to some of its extensions. We first considered a known extension: Kleene algebras with converse. Decidability of these algebras was already known, but the algorithm witnessing this result was too complicated to be practical. We proposed a simpler algorithm, more efficient, and whose correctness is easier to establish. It allowed us to prove that this problem lies in the complexity class PSpace-complete.Then we studied Kleene allegories. Few results were known about this extension. Following results about closely related algebras, we established the equivalence between equality in Kleene allegories and equality of certain sets of graphs. We then developed an original automaton model (so-called Petri automata), based on Petri nets. We proved the equivalence between the original problem and comparing these automata. In the restricted setting of identity-free Kleene lattices, we also provided an algorithm performing this comparison. This algorithm uses exponential space. However, we proved that the problem of comparing Petri automata lies in the class ExpSpace-complete.Finally, we studied Nominal Kleene algebras. We realised that existing descriptions of these algebra were not suited to relational semantics of programming languages. We thus modified them accordingly, and doing so uncovered several natural variations of this model. We then studied formally the bridges one could build between these variations, and between the existing model and our new version of it. This study was conducted using the proof assistant Coq
Document type :
Complete list of metadata

Cited literature [64 references]  Display  Hide  Download

Contributor : Abes Star :  Contact
Submitted on : Friday, February 3, 2017 - 11:38:08 AM
Last modification on : Saturday, September 11, 2021 - 3:18:33 AM
Long-term archiving on: : Friday, May 5, 2017 - 12:13:41 PM


Version validated by the jury (STAR)


  • HAL Id : tel-01455083, version 1


Paul Brunet. Algebras of Relations : from algorithms to formal proofs. Computation and Language [cs.CL]. Université de Lyon, 2016. English. ⟨NNT : 2016LYSE1198⟩. ⟨tel-01455083⟩



Record views


Files downloads