Dynamic Communicating Automata and Branching High-Level MSCs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Dynamic Communicating Automata and Branching High-Level MSCs


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.
Fichier principal
Vignette du fichier
lata2013.pdf (196.25 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00879353 , version 1 (02-11-2013)


  • HAL Id : hal-00879353 , version 1


Benedikt Bollig, Aiswarya Cyriac, Loic Helouet, Ahmet Kara, Thomas Schwentick. Dynamic Communicating Automata and Branching High-Level MSCs. LATA 2013, Apr 2013, bilbao, Spain. pp.177-189. ⟨hal-00879353⟩
450 View
338 Download


Gmail Facebook Twitter LinkedIn More