@inproceedings{efd4ed14974d473a8b966b1485682ba1,
title = "Dynamic Message Sequence charts",
abstract = "We introduce a formalism to specify classes of MSCs over an unbounded number of processes. The formalism can describe many interesting behaviours of dynamically changing networks of processes. Moreover, it strictly includes the formalism of Message Sequence Graphs studied in the literature to describe MSCs over a fixed finite set of processes. Our main result is that model-checking of MSCs described in this formalism against a suitable monadic-second order logic is decidable.",
author = "Martin Leucker and P. Madhusudan and Supratik Mukhopadhyay",
year = "2002",
doi = "10.1007/3-540-36206-1_23",
language = "English (US)",
isbn = "3540002251",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer",
pages = "253--264",
editor = "Manindra Agrawal and Anil Seth",
booktitle = "FST TCS 2002",
address = "Germany",
note = "22nd International Conference on the Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2002 ; Conference date: 12-12-2002 Through 14-12-2002",
}