Brzozowski goes concurrent -- a Kleene theorem for pomset languages
From MaRDI portal
Publication:5111639
DOI10.4230/LIPICS.CONCUR.2017.25zbMATH Open1442.68145arXiv1704.07199MaRDI QIDQ5111639FDOQ5111639
Fabio Zanasi, Paul Brunet, Tobias Kappé, Alexandra Silva, Bas Luttik
Publication date: 27 May 2020
Full work available at URL: https://arxiv.org/abs/1704.07199
Recommendations
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- NetKAT
- Title not available (Why is that?)
- Derivatives of Regular Expressions
- Coalgebraic Bisimulation-Up-To
- The equational theory of pomsets
- A completeness theorem for Kleene algebras and the algebra of regular events
- Series-parallel languages and the bounded-width property
- Developments in concurrent Kleene algebra
- Concurrent Kleene algebra with tests and branching automata
- Concurrent Kleene Algebra
- Title not available (Why is that?)
- Title not available (Why is that?)
- Concurrent Kleene Algebra with Tests
- Completeness Theorems for Bi-Kleene Algebras and Series-Parallel Rational Pomset Languages
- Synchronous Kleene algebra
- Programming Techniques: Regular expression search algorithm
- Deciding Synchronous Kleene Algebra with Derivatives
- Title not available (Why is that?)
Cited In (6)
Uses Software
This page was built for publication: Brzozowski goes concurrent -- a Kleene theorem for pomset languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111639)