Completeness for Identity-free Kleene Lattices

DOI10.4230/LIPIcs.CONCUR.2018.18OpenAlexW2889005041MaRDI QIDQ5009432

Amina Doumane, Damien Pous

Publication date: 4 August 2021

Full work available at URL: https://hal.archives-ouvertes.fr/hal-01780845

zbMATH Keywords

Kleene algebraKleene theoremgraph languagesPetri automata

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

Unnamed Item ⋮ Unnamed Item

Uses Software

• NetKAT
• Regular Sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Programming and automating mathematics in the Tarski-Kleene hierarchy
• Axiomatizability of positive algebras of binary relations
• The equational theory of Kleene lattices
• Complete systems of \(\mathcal B\)-rational identities
• A completeness theorem for Kleene algebras and the algebra of regular events
• The equational theory of union-free algebras of relations
• Representations of distributive lattice-ordered semigroups with binary relations
• Concurrent Kleene algebra: free model and completeness
• Proof Pearl: regular expression equivalence and relation algebra
• Completeness and incompleteness in nominal Kleene algebra
• Deciding Kleene Algebras in Coq
• Automated Engineering of Relational and Algebraic Methods in Isabelle/HOL
• Concurrent Kleene Algebra
• On Automating the Calculus of Relations
• Une condition impliquant toutes les identités rationnelles
• Petri Automata for Kleene Allegories
• Kleene Algebra with Tests and Coq Tools for while Programs
• NetKAT
• Completeness Theorems for Bi-Kleene Algebras and Series-Parallel Rational Pomset Languages
• On Hoare logic and Kleene algebra with tests

This page was built for publication: Completeness for Identity-free Kleene Lattices