The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
Elements of an automata theory over partial orders
POMIV '96 Proceedings of the DIMACS workshop on Partial order methods in verification
Languages, automata, and logic
Handbook of formal languages, vol. 3
On Communicating Finite-State Machines
Journal of the ACM (JACM)
Inference of message sequence charts
Proceedings of the 22nd international conference on Software engineering
On Logics, Tilings, and Automata
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Infinite-State High-Level MSCs: Model-Checking and Realizability
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Syntactic Detection of Process Divergence and Non-local Choice inMessage Sequence Charts
TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Recognizable Sets of Message Sequence Charts
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Automata Theory on Trees and Partial Orders
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
The monadic quantifier alternation hierarchy over grids and graphs
Information and Computation - Special issue: LICS'97
The Monadic Quantifier Alternation Hierarchy over Graphs is Infinite
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Regular sets of infinite message sequence charts
Information and Computation
Realizability of high-level message sequence charts: closing the gaps
Theoretical Computer Science
Information and Computation
A theory of regular MSC languages
Information and Computation
A kleene theorem for a class of communicating automata with effective algorithms
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
On Communicating Automata with Bounded Channels
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Muller message-passing automata and logics
Information and Computation
MSO Logic for Unambiguous Shared-Memory Systems
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Pomset Languages of Finite Step Transition Systems
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
Replaying play in and play out: synthesis of design models from scenarios by learning
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Synthesis of safe message-passing systems
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Automata and logics for timed message sequence charts
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Propositional dynamic logic for message-passing systems
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
An automaton over data words that captures EMSO logic
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
On Communicating Automata with Bounded Channels
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Event clock message passing automata: a logical characterization and an emptiness checking algorithm
Formal Methods in System Design
| Hi-index | 0.00 |
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. Furthermore, 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.