Recovering Repetitive Sub-Functions from Observations in
Distributed Systems

Abstract
Given an observation obtained by the execution of an existing concurrent
system with repetitive sub-functions, we can construct a Message Sequence
Chart (MSC) representing the functionality executed. This presentation
proposes an algorithm which, given a set of observations, constructs under
specific assumptions an 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.