scientific article; zbMATH DE number 7204942
From MaRDI portal
Publication:5111639
DOI10.4230/LIPIcs.CONCUR.2017.25zbMath1442.68145arXiv1704.07199MaRDI QIDQ5111639
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
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (4)
Manipulation of regular expressions using derivatives: an overview ⋮ On series-parallel pomset languages: rationality, context-freeness and automata ⋮ Learning pomset automata ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Developments in concurrent Kleene algebra
- Concurrent Kleene algebra with tests and branching automata
- Synchronous Kleene algebra
- 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
- Coalgebraic Bisimulation-Up-To
- Deciding Synchronous Kleene Algebra with Derivatives
- Concurrent Kleene Algebra
- NetKAT
- Concurrent Kleene Algebra with Tests
- Completeness Theorems for Bi-Kleene Algebras and Series-Parallel Rational Pomset Languages
- Programming Techniques: Regular expression search algorithm
- Derivatives of Regular Expressions
This page was built for publication:
