Concurrent Kleene Algebra (CKA) is a mathematical formalism to study programs that exhibit concurrent behaviour. As with previous extensions of Kleene Algebra, characterizing the free model is crucial in order to develop the foundations of the theory and potential applications. For CKA, this has been an open question for a few years and this paper makes an important step towards an answer. We present a new automaton model and a Kleene-like theorem that relates a relaxed version of CKA to series-parallel pomset languages, which are a natural candidate for the free model. There are two substantial differences with previous work: from expressions to automata, we use Brzozowski derivatives, which enable a direct construction of the automaton; from automata to expressions, we provide a syntactic characterization of the automata that denote valid CKA behaviours.
|Name||Leibniz International Proceedings in Informatics (LIPIcs)|
|Publisher||Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik|
|Conference||28th International Conference on Concurrency Theory, CONCUR 2017|
|Period||5/09/17 → 8/09/17|
- Brzozowski derivatives
- Kleene theorem
- Series-rational expressions