{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:53:01Z","timestamp":1753894381114,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2021,8,13]],"date-time":"2021-08-13T00:00:00Z","timestamp":1628812800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"crossref","award":["679127"],"award-info":[{"award-number":["679127"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Pomset automata are an operational model of weak bi-Kleene algebra, which\ndescribes programs that can fork an execution into parallel threads, upon\ncompletion of which execution can join to resume as a single thread. We\ncharacterize a fragment of pomset automata that admits a decision procedure for\nlanguage equivalence. Furthermore, we prove that this fragment corresponds\nprecisely to series-rational expressions, i.e., rational expressions with an\nadditional operator for bounded parallelism. As a consequence, we obtain a new\nproof that equivalence of series-rational expressions is decidable.<\/jats:p>","DOI":"10.46298\/lmcs-17(3:19)2021","type":"journal-article","created":{"date-parts":[[2021,8,23]],"date-time":"2021-08-23T20:49:26Z","timestamp":1629751766000},"source":"Crossref","is-referenced-by-count":0,"title":["Equivalence checking for weak bi-Kleene algebra"],"prefix":"10.46298","volume":"Volume 17, Issue 3","author":[{"given":"Tobias","family":"Kapp\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Brunet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bas","family":"Luttik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandra","family":"Silva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6457-1345","authenticated-orcid":false,"given":"Fabio","family":"Zanasi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2021,8,13]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/8358\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/8358\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T20:20:03Z","timestamp":1687292403000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/7502"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,13]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-17(3:19)2021","relation":{"has-preprint":[{"id-type":"arxiv","id":"1807.02102v4","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"1807.02102","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1807.02102","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2021,8,13]]},"article-number":"7502"}}