Reasoning about Sequential and Branching Behaviours of Message Sequence Graphs (0)
| Venue: | In ICALP ’00, LNCS 2076 |
| Citations: | 18 - 2 self |
BibTeX
@INPROCEEDINGS{Madhusudan_reasoningabout,
author = {P. Madhusudan},
title = {Reasoning about Sequential and Branching Behaviours of Message Sequence Graphs},
booktitle = {In ICALP ’00, LNCS 2076},
year = {},
pages = {396--407},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We study the model-checking problem of message-sequence graphs (MSGs). In the sequential setting, we consider the set of message-sequence charts (MSCs) represented by an MSG and tackle specifications given in monadic second-order logic. We show that this problem, without any restrictions on the MSGs, is decidable. We then turn to branching behaviours of MSGs, define a notion of an unfolding of an MSG, and show that the model-checking problem on unfoldings is also decidable. Our results are stronger and imply that, over an appropriate universe, satisfiability and synthesis of MSCs and MSGs, respectively, are decidable.
