Causal Closure for MSC Languages

Message sequence charts (MSCs) are commonly used to specify interactions between agents in communicating systems. Their visual nature makes them attractive for describing scenarios, but also leads to ambiguities that can result in incomplete or inconsistent descriptions. One such problem is that of implied scenarios—a set of MSCs may imply new MSCs which are “locally consistent” with the given set. If local consistency is defined in terms of local projections of actions along each process, it is undecidable whether a set of MSCs is closed with respect to implied scenarios, even for regular MSC languages [3]. We introduce a new and natural notion of local consistency called causal closure, based on the causal view of a process—all the information it collects, directly or indirectly, through its actions. Our main result is that checking whether a set of MSCs is closed with respect to implied scenarios modulo causal closure is decidable for regular MSC languages.

[1]  Kousha Etessami,et al.  A Hierarchy of Polynomial-Time Computable Simulations for Automata , 2002, CONCUR.

[2]  Madhavan Mukund,et al.  A theory of regular MSC languages , 2005, Inf. Comput..

[3]  Sjouke Mauw,et al.  Message Sequence Chart (MSC) , 1996 .

[4]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[5]  Anca Muscholl,et al.  A Kleene Theorem for a Class of Communicating Automata with Effective Algorithms , 2004, Developments in Language Theory.

[6]  Claude Jard,et al.  Modeling and Verification of Parallel Processes , 2001, Lecture Notes in Computer Science.

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

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

[9]  Rajeev Alur,et al.  Realizability and verification of MSC graphs , 2005, Theor. Comput. Sci..

[10]  Anca Muscholl,et al.  Infinite-state high-level MSCs: Model-checking and realizability , 2002, J. Comput. Syst. Sci..

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

[12]  C. A. Petri,et al.  Concurrency Theory , 1986, Advances in Petri Nets.

[13]  Madhavan Mukund,et al.  Bounded time-stamping in message-passing systems , 2003, Theor. Comput. Sci..

[14]  Michel A. Reniers,et al.  High-level message sequence charts , 1997, SDL Forum.

[15]  David Harel,et al.  Executable object modeling with statecharts , 1996, Proceedings of IEEE 18th International Conference on Software Engineering.

[16]  Grzegorz Rozenberg,et al.  Developments in Language Theory II , 2002 .

[17]  Leszek Pacholski,et al.  Mathematical Foundations of Computer Science 1999 , 1999, Lecture Notes in Computer Science.

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

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

[20]  Ivar Jacobson,et al.  The Unified Modeling Language User Guide , 1998, J. Database Manag..

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