Realizability of Dynamic MSC Languages

Abstract. We introduce dynamic communicating automata (DCA), an extension of communicating finite-state machines that allows for dynamic creation of processes. Their behavior can be described as sets of message sequence charts (MSCs). We consider the realizability problem for DCA: given a dynamic MSC grammar (a high-level MSC specification), is there a DCA defining the same set of MSCs? We show that this problem is decidable in doubly exponential time, and identify a class of realizable grammars that can be implemented by finite DCA.

• Type: Conference
• Year: 2010
• Where: CSR
• Authors: Benedikt Bollig, Loïc Hélouët
• Keywords: CSR 2010, Dynamic Communicating Automata, Dynamic Msc Grammar, Message Sequence Charts, Theoretical Computer Science