Equivalence checking for weak biKleene algebra
Abstract
Pomset automata are an operational model of weak biKleene algebra, which describes programs that can fork an execution into parallel threads, upon completion of which execution can join to resume as a single thread. We characterize a fragment of pomset automata that admits a decision procedure for language equivalence. Furthermore, we prove that this fragment corresponds precisely to seriesrational expressions, i.e., rational expressions with an additional operator for bounded parallelism. As a consequence, we obtain a new proof that equivalence of seriesrational expressions is decidable.
 Publication:

arXiv eprints
 Pub Date:
 July 2018
 arXiv:
 arXiv:1807.02102
 Bibcode:
 2018arXiv180702102K
 Keywords:

 Computer Science  Formal Languages and Automata Theory