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 specification 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 effectively implies implementability. © 2013 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Bollig, B., Cyriac, A., Hélouët, L., Kara, A., & Schwentick, T. (2013). Dynamic communicating automata and branching high-level MSCs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7810 LNCS, pp. 177–189). Springer Verlag. https://doi.org/10.1007/978-3-642-37064-9_17
Mendeley helps you to discover research relevant for your work.