Realizability of Dynamic MSC Languages

10 years 9 months ago
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.
Benedikt Bollig, Loïc Hélouët
Added 19 Jul 2010
Updated 19 Jul 2010
Type Conference
Year 2010
Where CSR
Authors Benedikt Bollig, Loïc Hélouët
Comments (0)