A Hierarchy of Implementable MSC Languages

We develop a unifying theory of message-passing automata (MPAs) and MSC languages. We study several variants of regular as well as product MSC languages, their closure under finite union and their intersection. Furthermore, we analyse the expressive power of several variants of MPAs and characterize the language classes of interest by the corresponding classes of MPAs