Beyond Message Sequence Graphs

We study the model-checking problem for classes of message sequence charts (MSCs) defined by two extensions of message sequence graphs (MSGs). These classes subsume the class of regular MSC languages. We show that the model checking problem for these extended message sequence graphs against monadic second-order specifications is decidable. Moreover, we present two ways to model-check the extended classes -- one extends the proof for MSGs while the other extends the proof for regular MSC languages.

[1]  Anca Muscholl,et al.  Compositional Message Sequence Charts , 2001, TACAS.

[2]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[3]  Wolfgang Thomas,et al.  Languages, Automata, and Logic , 1997, Handbook of Formal Languages.

[4]  Doron A. Peled,et al.  Specification and Verification of Message Sequence Charts , 2000, FORTE.

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

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

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

[8]  Ekkart Rudolph,et al.  Tutorial on Message Sequence Charts , 1996, Comput. Networks ISDN Syst..

[9]  Ramaswamy Ramanujam,et al.  Reasoning about Message Passing in Finite State Environments , 2000, ICALP.

[10]  P. Madhusudan,et al.  Reasoning about Sequential and Branching Behaviours of Message Sequence Graphs , 2001, ICALP.

[11]  Igor Walukiewicz,et al.  An Expressively Complete Linear Time Temporal Logic for Mazurkiewicz Traces , 1997, Inf. Comput..

[12]  Rajeev Alur,et al.  Inference of message sequence charts , 2000, Proceedings of the 2000 International Conference on Software Engineering. ICSE 2000 the New Millennium.

[13]  Madhavan Mukund,et al.  On Message Sequence Graphs and Finitely Generated Regular MSC Languages , 2000, ICALP.