A completeness theorem for nondeterministic Kleene algebras

DOI10.1007/3-540-58338-6_100zbMath1493.68196OpenAlexW1600458822MaRDI QIDQ5096912

Rocco De Nicola, Anna Labella

Publication date: 18 August 2022

Published in: Mathematical Foundations of Computer Science 1994 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58338-6_100

Mathematics Subject Classification ID

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

Related Items (4)

The equational logic of fixed points ⋮ Revisiting sequential composition in process calculi ⋮ Models of nondeterministic regular expressions ⋮ A complete equational axiomatization for MPA with string iteration

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enriched categorical semantics for distributed calculi
• Fixed points in free process algebras. I
• Algebraic laws for nondeterminism and concurrency
• The Category-Theoretic Solution of Recursive Domain Equations
• Process Algebra
• Termination, deadlock, and divergence
• Two Complete Axiom Systems for the Algebra of Regular Events

This page was built for publication: A completeness theorem for nondeterministic Kleene algebras