Proc. CONCUR 2003, Springer LNCS (2003)

Netcharts: Bridging the gap between HMSCs and executable specifications

M Mukund, K Narayan Kumar and P S Thiagarajan

Proc. CONCUR '03, Springer LNCS 2761 (2003) 296-310.

© Springer-Verlag Berlin Heidelberg

Abstract

We define a new notation called netcharts for describing sets of message sequence chart scenarios (MSCs). Netcharts correspond to a distributed version of High-level Message Sequence Charts (HMSCs). Netcharts improve on HMSCs in two respects.

  1. Netcharts admit a natural and direct translation into communicating finite-state machines, unlike HMSCs, for which the realization problem is nontrivial.
  2. Netcharts can describe all regular MSC languages (sets of MSCs in which channel capacities have a finite upper bound), unlike HMSCs, which can only describe finitely-generated regular MSC languages.
Available as gzipped dvi, gzipped Postscript , PDF. Back to Madhavan Mukund's home page.