Recovering Repetitive Sub-functions from Observations

This paper proposes an algorithm which, given a set of observations of an existing concurrent system that has repetitive subfunctions, 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.

• Type: Conference
• Year: 2007
• Where: FORTE
• Authors: Guy-Vincent Jourdan, Hasan Ural, Shen Wang, Hüsnü Yenigün
• Keywords: Concurrent System, Fewer Assumptions, Formal Methods, FORTE 2007, Message Sequence Charts