Abstract. We study dynamic communicating automata (DCA), an ex- tension of classical communicating finite-state machines that allows for.

Whenever p sends to q (or sends a message containing q), there is a path from some event of q to the send event, possibly using q in reverse direction.

We study dynamic communicating automata (DCA), an extension of classical communicating finite-state machines that allows for dynamic creation of processes.

Nov 2, 2013 · We study dynamic communicating automata (DCA), an ex- tension of classical communicating finite-state machines that allows for dynamic creation ...

We study dynamic communicating automata (DCA), an extension of classical communicating finite-state machines that allows for dynamic creation of processes.

This work introduces the notion of executability, a decidable necessary criterion for implementability in dynamic communicating automata, and identifies a ...

We study dynamic communicating automata (DCA), an extension of classical communicating finite-state machines that allows for dynamic creation of processes.

Bibliographic details on Dynamic Communicating Automata and Branching High-Level MSCs.

Publications that cite this publication ; Dynamic Communicating Automata and Branching High-Level MSCs. Benedikt Bollig, Aiswarya Cyriac, Loïc Hélouët, Ahmet ...

We study dynamic communicating automata (DCA), an extension of classical communicating finite-state machines that allows for dynamic creation of processes.