Message Sequence Charts: A Survey

Reference: Genest, B. & Muscholl, A. (2005). Message Sequence Charts: A Survey. In Proc. 5th International Conference on Application of Concurrency to System Design (ACSD 2005), St. Malo, France, pp. 2–4. IEEE Computer Society. DOI 10.1109/ACSD.2005.25. (Invited survey; a fuller treatment appears in Genest, Muscholl & Peled, Message Sequence Charts, LNCS 3098, 2004.) URL.

Summary

This invited survey by Genest and Muscholl maps the theory of Message Sequence Charts (MSCs) and their compositional extension, high-level MSCs (HMSCs / MSC-graphs), from the standpoint of concurrency theory and automata. An MSC gives a partial-order (visual) semantics to one communication scenario among asynchronously communicating processes; an HMSC glues MSCs with choice, concatenation and loops to specify infinite families of scenarios. The survey organises the main results of the field: the formal (partial-order and language) semantics of MSCs, the expressiveness and closure properties of HMSC languages, and — crucially — the tight relationship between HMSC specifications and communicating finite-state machines (channel automata) that implement them.

The recurring theme is that unrestricted MSC/HMSC specifications quickly become intractable, so the theory is built around well-behaved subclasses. The survey reviews bounded (channel-bounded) and existentially-bounded MSC languages — those realizable with finite communication buffers — and the notions of safe / local-choice HMSCs that admit deadlock-free distributed implementations, connecting directly to the realizability programme of Realizability and Verification of MSC Graphs. It surveys the decidability frontier for model-checking MSCs against HMSC specifications and for comparing specifications, noting where problems become undecidable and which structural restrictions restore decidability. As a short roadmap paper it is best read as an entry point and index into the MSC literature rather than as a single technical result.

Key Ideas

MSC semantics: a single scenario as a labelled partial order over send/receive events among asynchronous processes.
HMSC / MSC-graph: MSCs composed by choice, sequential concatenation and iteration to describe (possibly infinite) sets of scenarios.
Communicating automata correspondence: HMSC specifications versus their implementation by communicating finite-state machines with message channels — the central object of the theory.
Bounded and existentially-bounded MSCs: the tractable subclasses realizable with finite buffers; the setting in which most positive (decidability) results live.
Realizability & safe/local-choice HMSCs: the structural conditions under which a specification has a deadlock-free distributed implementation.
Decidability landscape: which model-checking and comparison problems are decidable, and which structural restrictions are needed to recover decidability.
Survey scope: a compact roadmap and bibliographic index into the MSC/HMSC literature.

Connections

Conceptual Contribution

Claim: The MSC/HMSC formalism is best understood through its correspondence with communicating automata and through the tractable subclasses (bounded, existentially-bounded, local-choice) for which realizability and verification are decidable; unrestricted specifications are intractable.
Mechanism: A survey that assembles the partial-order semantics of MSCs, the language theory of HMSCs, the channel-automata implementation model, and the decidability results for the well-behaved subclasses into a single map of the field.
Concepts introduced/used: Message Sequence Charts, HMSC / MSC-graph, Communicating Finite State Machines, bounded / existentially-bounded MSC languages, safe / local-choice HMSCs, Realizability.
Stance: survey / expository
Relates to: The companion technical anchor is Realizability and Verification of MSC Graphs (Alur–Etessami–Yannakakis); the same communicating-automata-vs-global-specification tension is later cast in session-type terms by Multiparty Compatibility in Communicating Automata and in service-choreography terms by Deciding Choreography Realizability.

Tags

#message-sequence-charts #survey #communicating-automata #realizability #concurrency-theory #foundational

Backlinks

Linked Pages

Deciding Choreography Realizability

Reference: Basu, S., Bultan, T. & Ouederni, M. (2012). Deciding Choreography Realizability. In Proc. 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2012), Philadelphia, PA, pp. 191–202. ACM. DOI 10.1145/2103656.2103680. URL.

Summary

A choreography specifies the allowable global orderings of message exchanges among the peers of a distributed system — a single state machine (a “conversation protocol”) describing who sends what to whom, in what order. The realizability question asks whether that global contract can actually be implemented: is there a set of distributed peers that, each acting on purely local information and communicating asynchronously over unbounded FIFO channels, together generate exactly the conversations the choreography prescribes — no missing behaviours and no unintended extra ones? Because the peers are obtained from the choreography by projection, the difficulty is that asynchrony lets them race ahead of the global order and produce conversations the choreography never intended.

The paper’s headline result is that, contrary to the prior expectation that unbounded-asynchronous realizability is undecidable, choreography realizability is decidable. The key device is synchronizability: a system of communicating peers is synchronizable when its observable conversation set is the same regardless of channel-buffer size — its behaviour under synchronous (rendez-vous) communication coincides with its behaviour under asynchronous buffering. Synchronizability can be checked by comparing the peers’ synchronous semantics with their 1-bounded asynchronous semantics, a finite check. Realizability is then decided by (i) projecting the choreography to peers, (ii) verifying that the projected system is synchronizable, and (iii) checking that the synchronous behaviour of those peers is language-equivalent to the choreography. When all hold, the finite (synchronous) analysis certifies the behaviour of the full unbounded-asynchronous system, so the otherwise infinite-state realizability question collapses to decidable equivalence checks.

Key Ideas

Choreography as a global contract: a state machine over the send events of all peers, fixing the allowable global message orderings.
Realizability: existence of distributed, locally-driven peers whose asynchronous FIFO interaction reproduces exactly the choreography’s conversation set.
Decidability result: realizability is decidable — even under unbounded asynchronous communication — refuting the assumption that it is not.
Synchronizability: behaviour is invariant to buffer size (synchronous ≡ asynchronous conversation sets); it is the hinge that makes the infinite-state problem finite.
Finite decision procedure: check synchronizability by comparing synchronous and 1-bounded asynchronous behaviour, then compare the synchronous behaviour to the choreography.
Projection + equivalence: project the global spec to peers and reduce realizability to language-equivalence checks over finite (bounded) system semantics.

Connections

Conceptual Contribution

Claim: Whether a global choreography can be faithfully implemented by asynchronously communicating peers is a decidable question, despite unbounded message buffers, provided the projected system is synchronizable.
Mechanism: Project the choreography to peer machines; decide synchronizability by comparing synchronous and 1-bounded asynchronous semantics; then check language-equivalence between the peers’ synchronous behaviour and the choreography — reducing an infinite-state problem to finite equivalence checks.
Concepts introduced/used: choreography / conversation protocol, Realizability, Synchronizability, Endpoint Projection, Communicating Finite State Machines.
Stance: formal / algorithmic (verification)
Relates to: The service-choreography counterpart of the MSC realizability programme in Realizability and Verification of MSC Graphs and Message Sequence Charts - A Survey; complementary to the session-type route to the same question in Multiparty Compatibility in Communicating Automata; the projection machinery is the Endpoint Projection used across Choreographic Programming (Structured Communication-Centred Programming for Web Services, Deadlock-freedom-by-design - Multiparty Asynchronous Global Programming), and the unrealizability pathologies it rules out are those Knowledge of Choice targets.

Tags

Multiparty Compatibility in Communicating Automata

Reference: Deniélou, P.-M. & Yoshida, N. (2013). Multiparty Compatibility in Communicating Automata: Characterisation and Synthesis of Global Session Types. In Proc. 40th International Colloquium on Automata, Languages and Programming (ICALP 2013), Part II, Riga, Latvia, LNCS 7966, pp. 174–186. Springer. DOI 10.1007/978-3-642-39212-2_18. Companion: Deniélou & Yoshida, Multiparty Session Types Meet Communicating Automata, ESOP 2012. URL.

Summary

This paper builds the bridge between two independently-developed theories of distributed communication: communicating finite-state machines (CFSMs) — Brand and Zafiropulo’s automata that exchange messages over unbounded FIFO channels — and multiparty session types (MPST), in which a single global type specifies a protocol among many participants and is projected to per-role local types. In the binary (two-party) case, safety follows from a simple duality condition between the two endpoints. Deniélou and Yoshida ask what the right generalisation of duality is for N participants, and answer with multiparty compatibility: a semantic condition on a system of CFSMs that guarantees the classic safety and liveness properties — no deadlock, no orphan (never-received) messages, and no unspecified reception — for the asynchronous communicating system.

Their two main results are a characterisation and a synthesis. On the characterisation side, they prove that a system of CFSMs is multiparty-compatible exactly when it is the behavioural image of a well-formed global session type: multiparty compatibility is precisely the property that makes a collection of communicating machines “look like” the projection of some global protocol. On the synthesis side, they give an algorithm that constructs a global session type from a compatible system of CFSMs, recovering the global protocol from its distributed endpoints. Together these results turn the informal correspondence “session types are a well-behaved subclass of communicating automata” into a precise equivalence, and give a route from legacy automata-based endpoint descriptions to type-level global specifications with their safety guarantees.

Key Ideas

CFSMs meet MPST: relates Brand–Zafiropulo communicating finite-state machines (asynchronous, FIFO-channel automata) to multiparty session types and their global/local type structure.
Multiparty compatibility: the N-party generalisation of binary-session duality — a semantic condition on a CFSM system ensuring safety.
Safety & liveness guaranteed: compatible systems enjoy deadlock-freedom, no orphan messages, and no unspecified receptions.
Characterisation: a CFSM system is multiparty-compatible iff it is behaviourally equivalent to the projection of a well-formed global session type.
Synthesis: an algorithm reconstructs a global session type from any multiparty-compatible system of CFSMs.
Bidirectional bridge: projection (global type → local CFSMs) and synthesis (compatible CFSMs → global type) make the correspondence an equivalence, not just an analogy.

Connections

Conceptual Contribution

Claim: Multiparty compatibility is the correct N-party generalisation of session-type duality: a system of communicating automata is safe-by-construction exactly when it is the behavioural projection of a well-formed global session type, and that global type can be mechanically recovered.
Mechanism: Define multiparty compatibility as a semantic condition on CFSM systems; prove it characterises exactly the projections of well-formed global types (safety + liveness); and give a synthesis algorithm that builds the global type from a compatible CFSM system.
Concepts introduced/used: Communicating Finite State Machines, multiparty compatibility, global session type, projection, safety (deadlock-freedom, no orphan messages, no unspecified reception).
Stance: formal / type-theoretic
Relates to: The session-type route to the realizability question studied automata-theoretically in Realizability and Verification of MSC Graphs and for choreographies in Deciding Choreography Realizability; extends the global/local projection discipline of Multiparty Asynchronous Session Types; its “no global types needed” counterpoint is Less is More - Multiparty Session Types Revisited. Direct companion to the authors’ ESOP 2012 Multiparty Session Types Meet Communicating Automata.

Tags

Realizability and Verification of MSC Graphs

Reference: Alur, R., Etessami, K. & Yannakakis, M. (2001). Realizability and Verification of MSC Graphs. In Proc. 28th International Colloquium on Automata, Languages and Programming (ICALP 2001), Crete, Greece, LNCS 2076, pp. 797–808. Springer. DOI 10.1007/3-540-48224-5_65. Journal version: Theoretical Computer Science 331(1):97–114, 2005, DOI 10.1016/j.tcs.2004.09.034. URL.

Summary

A Message Sequence Chart (MSC) describes a single scenario of communication among distributed processes as a partial order over send/receive events; an MSC-graph (equivalently a high-level MSC, HMSC) composes individual MSCs through choice, concatenation and loops to describe a set of scenarios — an early, visual model of a system amenable to analysis. Alur, Etessami and Yannakakis ask the foundational question of realizability: given such a scenario-based specification, does there exist a distributed implementation (a collection of communicating automata, one per process, exchanging messages over channels) whose behaviours are exactly the scenarios the graph specifies — no more and no fewer?

The paper’s central observation is that a distributed implementation is forced to exhibit implied scenarios: because each process sees only its own local events, any implementation of a set of MSCs also generates every scenario in the closure of that set, and these implied behaviours may not be in the original specification. This gap is the source of unrealizability (the classic culprit being non-local choice, where a branch is decided by one process but not communicated to others). The authors formalise two notions — weak realizability (the implementation’s behaviours match the specification) and safe realizability (additionally the implementation is deadlock-free, so no implied behaviour gets stuck) — and settle their decidability and complexity. For bounded MSC-graphs, weak realizability is undecidable, whereas safe realizability is decidable (in EXPSPACE). They also study verification: to model-check an MSC-graph one must check not just the specified scenarios but the whole closure of implied scenarios that any implementation must include, and they chart the associated complexity.

Key Ideas

MSC-graph / HMSC: individual MSCs (partial orders over messaging events) composed via choice, sequencing and iteration to specify a set of scenarios.
Realizability question: does a distributed implementation exist whose behaviour is exactly the specified set of scenarios?
Implied scenarios / closure: local-only knowledge forces any implementation to also generate the closure of the specified MSCs; the extra behaviours are the obstacle to realizability.
Non-local choice: a branch chosen by one process but invisible to others — the canonical reason a specification is unrealizable.
Weak vs. safe realizability: weak = behaviours match; safe = behaviours match and the implementation is deadlock-free.
Decidability boundary: for bounded MSC-graphs, weak realizability is undecidable while safe realizability is decidable (EXPSPACE).
Verification over the closure: correct model-checking of an MSC-graph must account for implied behaviours, not only the drawn scenarios.

Connections

Conceptual Contribution

Claim: Scenario-based specifications cannot in general be implemented verbatim: any distributed realization is forced to include implied scenarios beyond those drawn, so realizability is a non-trivial (sometimes undecidable) property that must be checked, not assumed.
Mechanism: Model the specification as an MSC-graph, define its closure under local-knowledge-preserving behaviour, and separate weak from safe (deadlock-free) realizability; decide safe realizability of bounded graphs in EXPSPACE while showing weak realizability undecidable.
Concepts introduced/used: Message Sequence Charts, MSC-graph / HMSC, implied scenario, closure, non-local choice, weak vs. safe Realizability.
Stance: formal / theoretical (automata & complexity theory)
Relates to: The distributed-systems root of the modern realizability line pursued for choreographies in Deciding Choreography Realizability and for Communicating Finite State Machines vs. global types in Multiparty Compatibility in Communicating Automata; surveyed alongside HMSC theory in Message Sequence Charts - A Survey. The “non-local choice” pathology is the same phenomenon that Knowledge of Choice addresses in Choreographic Programming.

Tags

Realizability

(page does not exist)

Communicating Finite State Machines

(page does not exist)

Message Sequence Charts

(page does not exist)

Communicating Sequential Processes

Reference

Hoare, C. A. R. (1978). “Communicating Sequential Processes.” Communications of the ACM, 21(8), 666-677. URL

Summary

Hoare proposes that input, output, and concurrent composition of processes deserve the same foundational status as assignment, sequencing, and iteration. CSP is a small language in which programs are built from sequential processes that synchronise by unbuffered, typed message exchange over named channels. A send P ! v and a matching receive Q ? x rendezvous: neither proceeds until both are ready. Dijkstra’s guarded commands — with nondeterministic choice — are generalized so that a guard may include a communication action, yielding a clean treatment of external choice, alternation, and fair scheduling.

The paper walks through a progression of examples — coroutines, prime sieve, matrix multiplication, bounded buffer, recursive subroutines implemented as processes, the dining philosophers — demonstrating how seemingly exotic concurrent patterns become compact CSP programs. Hoare’s deliberate methodological stance is that structured concurrency can be as tractable as structured sequential programming, provided the primitives are well-chosen: synchronous rendezvous avoids the subtleties of mailboxes and shared state; named channels make communication explicit in the program text; guarded commands make nondeterminism principled.

CSP seeded a lineage of enormous practical and theoretical impact: occam (the transputer language), the CSP process algebra (Hoare 1985, Roscoe) with refinement-based verification via FDR, the Go programming language’s goroutines and channels, Rust’s std::sync::mpsc, and the modern “structured concurrency” revival. Together with Hewitt’s actors, CSP defines one of the two great alternatives to shared-memory threads.

Key Ideas

Synchronous message passing: unbuffered rendezvous between named processes; no shared memory.
Named channels / named processes: communication is part of program structure, syntactically explicit.
Guarded commands with I/O guards: nondeterministic alternation and repetition over communications.
Parallel composition (||): processes execute concurrently, synchronizing only at matched send/receive.
No implicit buffering: forces designers to reason about liveness and deadlock directly.
Refinement and equivalence: later formalized as a process algebra with bisimulation / failures refinement.
Structured concurrency: parallelism as a first-class program-structuring mechanism, not threads-as-afterthought.

Connections

Actor Model — the other great message-passing tradition; CSP is channel-centric where actors are mailbox-centric.
A Universal Modular Actor Formalism for Artificial Intelligence
Hoare Logic — Hoare’s earlier work on axiomatic reasoning underlies his insistence on structured primitives.
Time Clocks and the Ordering of Events in a Distributed System — rendezvous provides a stronger local synchrony than Lamport’s messages.
Let It Crash