Generalised Regular MSC Languages

We establish the concept of regularity for languages consisting of Message Sequence Charts (MSCs). To this aim, we formalise their behaviour by string languages and give a natural definition of regularity in terms of an appropriate Nerode right congruence. Moreover, we present a class of accepting automata and establish several decidability and closure properties of MSC languages. We also provide a logical characterisation by a monadic second-order logic interpreted over MSCs. In contrast to existing work on regular MSC languages, our approach is neither restricted to a certain class of MSCs nor tailored to a fixed communication medium (such as a FIFO channel). It explicitly allows MSCs with message overtaking and is thus applicable to a broad range of channel types like mixtures of stacks and FIFOs.

[1]  Sjouke Mauw,et al.  Formal semantics of Message Sequence Charts , 1998 .

[2]  Anca Muscholl,et al.  Compositional message sequence charts , 2001, International Journal on Software Tools for Technology Transfer.

[3]  M. Papazoglou,et al.  Information Brokering: Design, Search and Transformation , 1996 .

[4]  Madhavan Mukund,et al.  Regular Collections of Message Sequence Charts , 2000, MFCS.

[5]  Yves Métivier,et al.  Partial Commutation and Traces , 1997, Handbook of Formal Languages.

[6]  Matthias Jarke,et al.  Model-driven planning and design of cooperative information systems , 1997 .

[7]  R. Studer,et al.  Survey on the Scenario Use in Twelve Selected Industrial Projects , 1998 .

[8]  Wieslaw Zielonka,et al.  Notes on Finite Asynchronous Automata , 1987, RAIRO Theor. Informatics Appl..

[9]  Marcin Jurdzinski,et al.  A Discrete Strategy Improvement Algorithm for Solving Parity Games , 2000, CAV.

[10]  Madhavan Mukund,et al.  Towards a Theory of Regular MSC Languages , 1999 .

[11]  P. Madhusudan,et al.  Beyond Message Sequence Graphs , 2001, FSTTCS.

[12]  Roland Baumann.  Client / Server Distribution in a Structure-Oriented Database Management System , 1997 .

[13]  Nissim Francez,et al.  Finite-Memory Automata , 1994, Theor. Comput. Sci..

[14]  Reidar Conradi,et al.  Version models for software configuration management , 1998, CSUR.

[15]  Markus Mohnen,et al.  Optimising the memory management of higher order functional programs , 1997 .

[16]  Dietrich Kuske,et al.  A Further Step towards a Theory of Regular MSC Languages , 2002, STACS.

[17]  Andy Schürr,et al.  Computing with Graphs and Graph Rewriting , 1999 .

[18]  Manfred A. Jeusfeld,et al.  Decision Support Components on the Internet 1 , 1995 .

[19]  Matthias Jarke,et al.  Intelligent Networks as a Data Intensive Application (INDIA) , 1994, ADB.

[20]  Rajeev Alur,et al.  Model Checking of Message Sequence Charts , 1999, CONCUR.

[21]  Jürgen Giesl,et al.  Transformation techniques for context-sensitive rewrite systems , 2004, J. Funct. Program..

[22]  Madhavan Mukund,et al.  Keeping Track of the Latest Gossip in Message-Passing Systems , 1995, STRICT.

[23]  Martin Staudt,et al.  VAREX: An Environment for Validating and Refining Rule Bases , 1996, IEA/AIE.

[24]  Thomas Schwentick,et al.  Towards Regular Languages over Infinite Alphabets , 2001, MFCS.

[25]  B. Bollig,et al.  Modelling, specifying, and verifying message passing systems , 2001, Proceedings Eighth International Symposium on Temporal Representation and Reasoning. TIME 2001.