Recovering the Lattice of Repetitive Sub-functions

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

DOI: 10.1007/11569596_97

Volume 3733 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Jourdan GV., Ural H., Yenigün H. (2005) Recovering the Lattice of Repetitive Sub-functions. In: Yolum ., Güngör T., Gürgen F., Özturan C. (eds) Computer and Information Sciences - ISCIS 2005. ISCIS 2005. Lecture Notes in Computer Science, vol 3733. Springer, Berlin, Heidelberg

Abstract

Given a set of observations of an existing concurrent system with repetitive sub-functions, we consider the construction of an MSC graph representing the functionality of the concurrent system. We first introduce a formal structure that we call ”lattice of repetitive sub-functions”. This lattice provides us with a global view of all the repetitive sub-functions of the system and all the compatible observations. Using the lattice, we are able to propose an algorithm that constructs the MSC graph representation of the system functionality in a more general context than in previously published work.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Guy-Vincent Jourdan
    • 1
  • Hasan Ural
    • 1
  • Hüsnü Yenigün
    • 2
  1. 1.School of Information Technology and Engineering (SITE)University of OttawaOttawaCanada
  2. 2.Faculty of Engineering and Natural SciencesSabancı UniversityTuzla, IstanbulTurkey