Brzozowski goes concurrent -- a Kleene theorem for pomset languages

DOI10.4230/LIPICS.CONCUR.2017.25MaRDI QIDQ5111639zbMATH OpenFDO

Authors Tobias Kappé, Paul Brunet, Bas Luttik, Alexandra Silva, Fabio Zanasi

Publication date 27 May 2020

Full work available at URL https://arxiv.org/abs/1704.07199

zbMATH Keywords

automataconcurrencyKleene theorempomsetsBrzozowski derivativesseries-rational expressions

Mathematics Subject Classification ID

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

Recommendations

• On series-parallel pomset languages: rationality, context-freeness and automata
• Concurrent Kleene algebra: free model and completeness
• Concurrent Kleene algebra with tests and branching automata
• Concurrent Kleene algebra with tests
• Concurrent Kleene algebra and its foundations

Cites work

• scientific article; zbMATH DE number 1033559 (Why is no real title available?)
• scientific article; zbMATH DE number 1086671 (Why is no real title available?)
• scientific article; zbMATH DE number 1136090 (Why is no real title available?)
• A completeness theorem for Kleene algebras and the algebra of regular events
• Brzozowski goes concurrent -- a Kleene theorem for pomset languages
• Coalgebraic bisimulation-up-to
• Completeness theorems for bi-Kleene algebras and series-parallel rational pomset languages
• Concurrent Kleene Algebra
• Concurrent Kleene algebra with tests
• Concurrent Kleene algebra with tests and branching automata
• Deciding synchronous Kleene algebra with derivatives
• Derivatives of Regular Expressions
• Developments in concurrent Kleene algebra
• Netkat, semantic foundations for networks
• Programming Techniques: Regular expression search algorithm
• Series-parallel languages and the bounded-width property
• Synchronous Kleene algebra
• The equational theory of pomsets

Cited in

(8)

• Learning pomset automata
• On series-parallel pomset languages: rationality, context-freeness and automata
• Brzozowski goes concurrent -- a Kleene theorem for pomset languages
• A Kleene theorem for higher-dimensional automata
• Concurrent Kleene algebra with tests and branching automata
• scientific article; zbMATH DE number 17816 (Why is no real title available?)
• Manipulation of regular expressions using derivatives: an overview
• scientific article; zbMATH DE number 4084982 (Why is no real title available?)

Describes a project that uses

Uses Software

• NetKAT

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)