Realizability and Verification of MSC-Graphs (2002)
by
Rajeev Alur
,
Kousha Etessami
,
Mihalis Yannakakis
| Citations: | 56 - 0 self |
BibTeX
@MISC{Alur02realizabilityand,
author = {Rajeev Alur and Kousha Etessami and Mihalis Yannakakis},
title = {Realizability and Verification of MSC-Graphs},
year = {2002}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Scenario-based specifications such as message sequence charts (MSC) o#er an intuitive and visual way to describe design requirements. MSC-graphs allow convenient expression of multiple scenarios, and can be viewed as an early model of the system that can be subjected to a variety of analyses. Problems such as LTL model checking are undecidable for MSC-graphs in general, but are known to be decidable for the class of bounded MSC-graphs.
