This article relates two different paradigms of descriptions of communication behavior, one
focusing on global message flows and another on end-point behaviors, using formal calculi …

We review the characterization of communicating finite-state machines whose behaviors
have universally or existentially bounded channels. These results rely on the theory of …

Several notions of synchronizability of a message-passing system have been introduced in
the literature. Roughly, a system is called synchronizable if every execution can be …

The behavior of a network of communicating automata is called existentially bounded if
communication events can be scheduled in such a way that the number of messages in …

This paper proposes a calculus for describing communication-centred programs and
discusses its use through a formal description of several use cases from real business …

We consider asynchronous networks of finite-state systems communicating via a
combination of reliable and lossy fifo channels. Depending on the topology, the reachability …

Communicating multi-pushdown systems model networks of multi-threaded recursive
programs communicating via reliable FIFO channels. We extend the notion of split-width [8] …

Interactions are graphical models representing communication flows between actors. Well-
known interaction languages include UML Sequence Diagrams or Message Sequence …

This paper is concerned with bridging the gap between requirements and distributed
systems. Requirements are defined as basic message sequence charts (MSCs) specifying …

Non-deterministic Finite Automata (NFA) represent regular languages concisely, increasing
their appeal for applications such as word recognition. This paper proposes a new approach …