A theory of regular MSC languages

  • Authors:

  • Jesper G. Henriksen;Madhavan Mukund;K. Narayan Kumar;Milind Sohoni;P. S. Thiagarajan

  • Affiliations:

  • BRICS,3BRICS: Basic Research in Computer Science (www.brics.dk), funded by the Danish National Research Foundation.3 Computer Science Department, Aarhus University, Aarhus, Denmark;Chennai Mathematical Institute 92 G.N. Chetty Road, Chennai 600017, India;Chennai Mathematical Institute 92 G.N. Chetty Road, Chennai 600017, India;Indian Institute of Technology Bombay, Mumbai, India;National University of Singapore, Singapore

  • Venue:
  • Information and Computation
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Message sequence charts (MSCs) are an attractive visual formalism widely used to capture system requirements during the early design stages in domains such as telecommunication software. It is fruitful to have mechanisms for specifying and reasoning about collections of MSCs so that errors can be detected even at the requirements level. We propose, accordingly, a notion of regularity for collections of MSCs and explore its basic properties. In particular, we provide an automata-theoretic characterization of regular MSC languages in terms of finite-state distributed automata called bounded message-passing automata. These automata consist of a set of sequential processes that communicate with each other by sending and receiving messages over bounded FIFO channels. We also provide a logical characterization in terms of a natural monadic second-order logic interpreted over MSCs. A commonly used technique to generate a collection of MSCs is to use a hierarchical message sequence chart (HMSC). We show that the class of languages arising from the so-called bounded HMSCs constitute a proper subclass of the class of regular MSC languages. In fact, we characterize the bounded HMSC languages as the subclass of regular MSC languages that are finitely generated.