Logical definability on infinite traces
ICALP Selected papers of the twentieth international colloquium on Automata, languages and programming
Languages, automata, and logic
Handbook of formal languages, vol. 3
On Communicating Finite-State Machines
Journal of the ACM (JACM)
Asynchronous cellular automata for promsets
Theoretical Computer Science
Asynchronous Cellular Automata for Infinite Traces
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Regular sets of infinite message sequence charts
Information and Computation
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
A theory of regular MSC languages
Information and Computation
A Kleene theorem and model checking algorithms for existentially bounded communicating automata
Information and Computation
Message-passing automata are expressively equivalent to EMSO logic
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Theories of automata on ω-tapes: A simplified approach
Journal of Computer and System Sciences
| Hi-index | 0.00 |
We study nonterminating message-passing automata whose behavior is described by infinite message sequence charts. As a first result, we show that Muller, Buchi, and termination-detecting Muller acceptance are equivalent for these devices. To describe the expressive power of these automata, we give a logical characterization. More precisely, we show that they have the same expressive power as the existential fragment of a monadic second-order logic featuring a first-order quantifier to express that there are infinitely many elements satisfying some property. This result is based on Vinner's extension of the classical Ehrenfeucht-Fraisse game to cope with the infinity quantifier.