We study the expressiveness of finite message-passing automata with a priori unbounded FIFO channels and show them to capture exactly the class of MSC languages that are definable in existential monadic second-order logic interpreted over MSCs. Moreover, we prove the monadic quantifier-alternation hierarchy over MSCs to be infinite and conclude that the class of MSC languages accepted by message-passing automata is not closed under complement. Furthermore, we show that satisfiability for (existential) monadic seconder-order logic over MSCs is undecidable. © Springer-Verlag 2004.
CITATION STYLE
Bollig, B., & Leucker, M. (2004). Message-passing automata are expressively equivalent to EMSO logic. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3170, 146–160. https://doi.org/10.1007/978-3-540-28644-8_10
Mendeley helps you to discover research relevant for your work.