Chapter

Formal Techniques for Networked and Distributed Systems – FORTE 2007

Volume 4574 of the series Lecture Notes in Computer Science pp 35-49

Recovering Repetitive Sub-functions from Observations

  • Guy-Vincent JourdanAffiliated withSchool of Information Technology and Engineering (SITE), University of Ottawa, 800 King Edward Avenue, Ottawa, Ontario, K1N 6N5
  • , Hasan UralAffiliated withSchool of Information Technology and Engineering (SITE), University of Ottawa, 800 King Edward Avenue, Ottawa, Ontario, K1N 6N5
  • , Shen WangAffiliated withSchool of Information Technology and Engineering (SITE), University of Ottawa, 800 King Edward Avenue, Ottawa, Ontario, K1N 6N5
  • , Hüsnü YenigünAffiliated withFaculty of Engineering and Natural Sciences, Sabancı University, Tuzla, Istanbul, 34956

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.