Brzozowski goes concurrent -- a Kleene theorem for pomset languages

DOI10.4230/LIPICS.CONCUR.2017.25zbMATH Open1442.68145arXiv1704.07199MaRDI QIDQ5111639FDOQ5111639

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

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

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)

Cites Work

• Netkat, semantic foundations for networks
• 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
• Brzozowski goes concurrent -- a Kleene theorem for pomset languages

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
• Title not available (Why is that?)
• Manipulation of regular expressions using derivatives: an overview
• Title not available (Why is that?)

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)