Infinite-State High-Level MSCs: Model-Checking and Realizability

We consider three natural classes of infinite-state HMSCs: globally-cooperative, locally-cooperative and local-choice HMSCs. We show first that model-checking for globally-cooperative and locally-cooperative HMSCs has the same complexity as for the class of finite-state (bounded) HMSCs. Surprisingly, model-checking local-choice HMSCs turns out to be exponentially more efficient in space than for locally-cooperative HMSCs. We also show that locally-cooperative and local-choice HMSCs can be always implemented by communicating finite states machines, provided we allow some additional (bounded) message data. Moreover, the implementation of local-choice HMSCs is deadlock-free and of linear-size.

[1]  Yves Métivier.  On Recognizable Subsets of Free Partially Commutative Monoids , 1988, Theor. Comput. Sci..

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

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

[4]  Anca Muscholl,et al.  Pattern Matching and Membership for Hierarchical Message Sequence Charts , 2002, LATIN.

[5]  P. S. Thiagarajan,et al.  Distributed Controller Synthesis for Local Specifications , 2001, ICALP.

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

[7]  Amir Pnueli,et al.  Distributed reactive systems are hard to synthesize , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[8]  Rajeev Alur,et al.  An Analyser for Mesage Sequence Charts , 1996, TACAS.

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

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

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

[12]  O. Kupermann,et al.  Synthesizing distributed systems , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

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

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

[15]  Madhavan Mukund,et al.  Synthesizing Distributed Finite-State Systems from MSCs , 2000, CONCUR.

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

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

[18]  Markus Lohrey.  Safe Realizability of High-Level Message Sequence Charts , 2002, CONCUR.

[19]  David Harel,et al.  Synthesizing State-Based Object Systems from LSC Specifications , 2000, Int. J. Found. Comput. Sci..

[20]  Edward Ochmanski.  Recognizable Trace Languages , 1995, The Book of Traces.

[21]  Manfred Broy,et al.  From MSCs to Statecharts , 1998, DIPES.