Completeness Theorems for Bi-Kleene Algebras and Series-Parallel Rational Pomset Languages
From MaRDI portal
Publication:5410478
DOI10.1007/978-3-319-06251-8_5zbMath1405.68198OpenAlexW81482733MaRDI QIDQ5410478
Georg Struth, Michael R. Laurence
Publication date: 16 April 2014
Published in: Relational and Algebraic Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-06251-8_5
Related Items (12)
Developments in concurrent Kleene algebra ⋮ Completeness and incompleteness in nominal Kleene algebra ⋮ Generating Posets Beyond N ⋮ Concurrent NetKAT. Modeling and analyzing stateful, concurrent networks ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On series-parallel pomset languages: rationality, context-freeness and automata ⋮ Learning pomset automata ⋮ Completeness for Identity-free Kleene Lattices ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for publication: Completeness Theorems for Bi-Kleene Algebras and Series-Parallel Rational Pomset Languages
