scientific article; zbMATH DE number 7559485

DOI10.4230/LIPIcs.CONCUR.2020.29MaRDI QIDQ5089295

Damien Pous, Amina Doumane

Publication date: 18 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

relation algebragraph homomorphisms(in)equational theories

Mathematics Subject Classification ID

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

Related Items (3)

Algorithmic correspondence for relevance logics, bunched implication logics, and relation algebras via an implementation of the algorithm \textsf{PEARL} ⋮ The class of representable semilattice-ordered monoids is not a variety ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Concurrent Kleene algebra and its foundations
• Axiomatizability of positive algebras of binary relations
• Equational properties of Kleene algebras of relations with conversion
• Relation algebras
• The equational theory of pomsets
• Conjunctive query containment revisited
• The equational theory of union-free algebras of relations
• Equational theory of relation algebras with positive operations
• On representable relation algebras
• The complexity of homomorphism and constraint satisfaction problems seen from the other side
• Representations of ordered semigroups and lattices by binary relations
• Petri Automata for Kleene Allegories
• Completeness for Identity-free Kleene Lattices
• Allegories

This page was built for publication: