Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

CONCUR
2004
Springer

favoriteEmaildiscussreport

88views Distributed And Parallel Com...» more CONCUR 2004»

Message-Passing Automata Are Expressively Equivalent to EMSO Logic

13 years 10 months ago

Message-Passing Automata Are Expressively Equivalent to EMSO Logic

Download www4.in.tum.de

Abstract. We study the expressiveness of ﬁnite message-passing automata with a priori unbounded FIFO channels and show them to capture exactly the class of MSC languages that are deﬁnable in existential monadic second-order logic interpreted over MSCs. Moreover, we prove the monadic quantiﬁer-alternation hierarchy over MSCs to be inﬁnite and conclude that the class of MSC languages accepted by message-passing automata is not closed under complement. Furthermore, we show that satisﬁability for (existential) monadic seconder-order logic over MSCs is undecidable.

Benedikt Bollig, Martin Leucker

Real-time Traffic

CONCUR 2004 | Message-passing Automata | Monadic Second-order Logic | ﬁnite Message-passing Automata |

claim paper

Related Content

» The complexity of lineartime temporal logic over the class of ordinals

» Monadic secondorder logic on treelike structures

» On Continuous Timed Automata with InputDetermined Guards

» The Complexity of Temporal Logic with Until and Since over Ordinals

» The Pros and Cons of Netcharts

» Automata and fixed point logic A coalgebraic perspective

» Weighted Automata and Weighted Logics with Discounting

» On the Power of TreeWalking Automata

» Model Checking Quantified Computation Tree Logic

Post Info
More Details (n/a)

Added	01 Jul 2010
Updated	01 Jul 2010
Type	Conference
Year	2004
Where	CONCUR
Authors	Benedikt Bollig, Martin Leucker

Comments (0)