Equivalence checking for weak bi-Kleene algebra

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...

Full description

Bibliographic Details
Main Authors: Tobias Kappé, Paul Brunet, Bas Luttik, Alexandra Silva, Fabio Zanasi
Format: Article
Language:English
Published: Logical Methods in Computer Science e.V. 2021-08-01
Series:Logical Methods in Computer Science
Subjects:
Online Access:https://lmcs.episciences.org/7502/pdf