Reversible Kleene lattices

DOI10.4230/LIPICS.MFCS.2017.66zbMATH Open1441.68137OpenAlexW2772999042MaRDI QIDQ5111283FDOQ5111283

Paul Brunet

Publication date: 26 May 2020

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

zbMATH Keywords

complexityautomatadecidabilityPetri netsKleene algebra

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Relationships between nondeterministic and deterministic tape complexities
• Title not available (Why is that?)
• Title not available (Why is that?)
• The equational theory of union-free algebras of relations
• The Recognition of Series Parallel Digraphs
• Two Complete Axiom Systems for the Algebra of Regular Events
• Notes on equational theories of relations
• Title not available (Why is that?)
• Equational properties of Kleene algebras of relations with conversion
• Nominal Kleene Coalgebra
• The equational theory of Kleene lattices
• Freshness and Name-Restriction in Sets of Traces with Names
• Title not available (Why is that?)
• Title not available (Why is that?)
• Petri Automata for Kleene Allegories
• Title not available (Why is that?)
• Completeness and Incompleteness in Nominal Kleene Algebra
• Reversible Kleene lattices

Cited In (3)

• Reversible Kleene lattices
• Title not available (Why is that?)
• Title not available (Why is that?)

   Recommendations

• Kleene Algebra with Converse 👍 👎
• Petri Automata for Kleene Allegories 👍 👎
• Algorithms for Kleene algebra with converse 👍 👎
• The equational theory of Kleene lattices 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Reversible Kleene lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111283)