%0 Conference Proceedings
%F bollig:hal-00879353
%A Bollig, B.
%A Cyriac, A.
%A Hélouet, L.
%A Kara, A.
%A Schwentick, T.
%T {Dynamic Communicating Automata and Branching High-Level MSCs}
%B {LATA 2013}
%E Horia Dediu, Adrian
%E Mart\'\in-Vide, Carlos
%E Truthe, Bianca
%V 7810
%P 177-189
%S LNCS
%I Springer
%C bilbao, Spain
%X {We study dynamic communicating automata (DCA), an extension of classical communicating finite-state machines that allows for dynamic creation of processes. The behavior of a DCA can be described as a set of message sequence charts (MSCs). While DCA serve as a model of an implementation, we propose branching high-level MSCs (bHMSCs) on the speci fication side. Our focus is on the implementability problem: given a bHMSC, can one construct an equivalent DCA? As this problem is undecidable, we introduce the notion of executability, a decidable necessary criterion for implementability. We show that executability of bHMSCs is EXPTIME-complete. We then identify a class of bHMSCs for which executability eff ectively implies implementability.}
%U http://hal.inria.fr/hal-00879353/PDF/lata2013.pdf
%8 April
%D 2013