Safe Realizability of High-Level Message Sequence Charts

We study the notion of safe realizability for high-level message sequence charts (HMSCs), which was introduced in [2]. We prove that safe realizability is EXPSPACE-complete for bounded HMSCs but undecidable for the class of all HMSCs. This solves two open problems from [2]. Moreover we prove that safe realizability is also EXPSPACE complete for the larger class of transition-connected HMSCs.

[1]  Christos H. Papadimitriou,et al.  Computational complexity , 1993 .

[2]  Gregor von Bochmann,et al.  Finite State Description of Communication Protocols , 1978, Comput. Networks.

[3]  Itu-T.  Specification and Description Language (SDL) , 1999 .

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

[5]  Rémi Morin,et al.  Recognizable Sets of Message Sequence Charts , 2002, STACS.

[6]  Igor Walukiewicz,et al.  Difficult Configurations—On the Complexity of LTrL , 1998, Formal Methods Syst. Des..

[7]  Anca Muscholl,et al.  Infinite-State High-Level MSCs: Model-Checking and Realizability , 2002, ICALP.

[8]  Anca Muscholl,et al.  Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces , 1999, MFCS.

[9]  Daniel Brand,et al.  On Communicating Finite-State Machines , 1983, JACM.

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

[11]  Rajeev Alur,et al.  Inference of Message Sequence Charts , 2003, IEEE Trans. Software Eng..

[12]  Loïc Hélouët,et al.  HMSCs as Partial Specifications ... with PNs as Completions , 2000, MOVEP.

[13]  Hanêne Ben-Abdallah,et al.  Syntactic Detection of Process Divergence and Non-local Choice inMessage Sequence Charts , 1997, TACAS.

[14]  Loïc Hélouët,et al.  Decomposition of Message Sequence Charts , 2000, SAM.

[15]  Kousha Etessami,et al.  Realizability and Veriication of Msc Graphs , 2001 .

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

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

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

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