@article{discovery10063343,
         journal = {Logical Methods in Computer Science},
            year = {2021},
           title = {Equivalence checking for weak bi-Kleene algebra},
          number = {3},
           month = {August},
           pages = {19:1--19:53},
            note = {This work is licensed under the Creative Commons Attribution License. To view a copy of this license, visit https://creativecommons.org/licenses/by/4.0/},
          volume = {17},
          author = {Kapp{\'e}, T and Brunet, P and Luttik, B and Silva, A and Zanasi, F},
        abstract = {Pomset automata are an operational model of weak bi-Kleene 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 series-rational expressions, i.e., rational expressions with an additional operator for bounded parallelism. As a consequence, we obtain a new proof that equivalence of series-rational expressions is decidable.},
             url = {https://doi.org/10.46298/lmcs-17(3:19)2021}
}