Sciweavers

CONCUR
2004
Springer
13 years 10 months ago
Message-Passing Automata Are Expressively Equivalent to EMSO Logic
Abstract. 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...
Benedikt Bollig, Martin Leucker