Causal closure for MSC languages

Adsul, Bharat ; Mukund, Madhavan ; Narayan Kumar, K. ; Narayanan, Vasumathi (2005) Causal closure for MSC languages In: 25th International Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2005, 15-18 Dec 2005, Hyderabad, India.

Full text not available from this repository.

Official URL:

Related URL:


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.

Item Type:Conference or Workshop Item (Paper)
Source:Copyright of this article belongs to Springer-Verlag.
ID Code:114149
Deposited On:25 May 2018 04:57
Last Modified:25 May 2018 04:57

Repository Staff Only: item control page