Ural, Hasan and Yenigün, Hüsnü (2004) Towards design recovery from observations. Lecture Notes in Computer Science (Formal Techniques for Networked and Distributed Systems - FORTE 2004, Proceedings), 3235 . pp. 133-149. ISSN 0302-9743 (Print) 1611-3349 (Online)
Full text not available from this repository. (Request a copy)
Official URL: http://dx.doi.org/10.1007/978-3-540-30232-2_9
Abstract
This paper proposes an algorithm for the construction of an MSC graph from a given set of actual behaviors of an existing concurrent system which has repetitive subfunctions. Such a graph can then be checked for safe realizability and be used as input to existing synthesis techniques.
| Item Type: | Article |
|---|---|
| Additional Information: | WoS - Open Access (Bronze) |
| Divisions: | Faculty of Engineering and Natural Sciences > Academic programs > Computer Science & Eng. Faculty of Engineering and Natural Sciences |
| Depositing User: | Hüsnü Yenigün |
| Date Deposited: | 25 Nov 2005 02:00 |
| Last Modified: | 26 Jun 2020 17:14 |
| URI: | https://research.sabanciuniv.edu/id/eprint/474 |
Actions (login required)
- View Item