Inference of Message Sequence Charts (2003)
Cached
Download Links
- [homepages.inf.ed.ac.uk]
- [www.cis.upenn.edu]
- [www.cis.upenn.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | Software Concepts and Tools |
| Citations: | 169 - 11 self |
BibTeX
@INPROCEEDINGS{Alur03inferenceof,
author = {Rajeev Alur and Kousha Etessami and Mihalis Yannakakis},
title = {Inference of Message Sequence Charts},
booktitle = {Software Concepts and Tools},
year = {2003},
pages = {304--313}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Software designers draw Message Sequence Charts for early modeling of the individual behaviors they expect from the concurrent system under design. Can they be sure that precisely the behaviors they have described are realizable by some implementation of the components of the concurrent system? If so, can we automatically synthesize concurrent state machines realizing the given MSCs? If, on the other hand, other unspecified and possibly unwanted scenarios are # A preliminary version of this paper appears in Proceedings of 22nd International Conference on Software Engineering, pages 304--313, 2000. A journal version will appear in IEEE Transactions in Software Engineering, but due to space limitations in the journal, this is the fuller version.
