Recovering Repetitive Sub-functions from Observations

  • Guy-Vincent Jourdan
  • Hasan Ural
  • Shen Wang
  • Hüsnü Yenigün
Conference paper

DOI: 10.1007/978-3-540-73196-2_3

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4574)
Cite this paper as:
Jourdan GV., Ural H., Wang S., Yenigün H. (2007) Recovering Repetitive Sub-functions from Observations. In: Derrick J., Vain J. (eds) Formal Techniques for Networked and Distributed Systems – FORTE 2007. FORTE 2007. Lecture Notes in Computer Science, vol 4574. Springer, Berlin, Heidelberg

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.

Download to read the full conference paper text

Copyright information

© IFIP International Federation for Information Processing 2007

Authors and Affiliations

  • Guy-Vincent Jourdan
    • 1
  • Hasan Ural
    • 1
  • Shen Wang
    • 1
  • Hüsnü Yenigün
    • 2
  1. 1.School of Information Technology and Engineering (SITE), University of Ottawa, 800 King Edward Avenue, Ottawa, Ontario, K1N 6N5Canada
  2. 2.Faculty of Engineering and Natural Sciences, Sabancı University, Tuzla, Istanbul, 34956Turkey

Personalised recommendations