Jourdan, Guy-Vincent and Ural, Hasan and Wang, Shen and Yenigün, Hüsnü (2007) Recovering repetitive sub-functions from observations. In: Formal Techniques for Networked and Distributed Systems – FORTE 2007, Tallinn, Estonia
Full text not available from this repository. (Request a copy)
Official URL: http://dx.doi.org/10.1007/978-3-540-73196-2_3
Abstract
This paper proposes an algorithm which, given a set of observations of an existing concurrent system that has repetitive sub-functions, constructs a Message Sequence Charts (MSC) graph where repetitive sub-functions of the concurrent system are identified. This algorithm makes fewer assumptions than previously published work, and thus requires fewer and easier to generate observations to construct the MSC-graph. The constructed MSC-graph may then be used as input to existing synthesis algorithms to recover the design of the existing concurrent system.
| Item Type: | Papers in Conference Proceedings |
|---|---|
| Subjects: | Q Science > QA Mathematics > QA075 Electronic computers. Computer science |
| Divisions: | Faculty of Engineering and Natural Sciences |
| Depositing User: | Hüsnü Yenigün |
| Date Deposited: | 24 Oct 2007 15:51 |
| Last Modified: | 26 Apr 2022 08:41 |
| URI: | https://research.sabanciuniv.edu/id/eprint/5781 |
Actions (login required)
- View Item