Advertisement

Synchronizing Behavioural Mismatch in Software Composition

  • Carlos Canal
  • Pascal Poizat
  • Gwen Salaün
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4037)

Abstract

Software Adaptation is a crucial issue for the development of a real market of components promoting software reuse. Recent work in this field has addressed several problems related to interface and behavioural mismatch. In this paper, we present our proposal for software adaptation, which builds on previous work overcoming some of its limitations, and makes a significant advance to solve pending issues. Our approach is based on the use of synchronous vectors and regular expressions for governing adaptation rules, and is supported by dedicated algorithms and tools.

Keywords

Regular Expression Behavioural Adaptation Label Transition System Process Algebra Component Interface 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Andrews, T., et al.: Business Process Execution Language for Web Services (WSBPEL). BEA Systems, IBM, Microsoft, SAP AG, and Siebel Systems (February 2005)Google Scholar
  2. 2.
    Arnold, A.: Finite Transition Systems. International Series in Computer Science. Prentice-Hall, Englewood Cliffs (1994)Google Scholar
  3. 3.
    Berthomieu, B., Ribet, P.-O., Vernadat, F.: The Tool TINA – Construction of Abstract State Spaces for Petri Nets and Time Petri Nets. International Journal of Production Research 42(14) (2004)Google Scholar
  4. 4.
    Bracciali, A., Brogi, A., Canal, C.: A Formal Approach to Component Adaptation. Journal of Systems and Software 74(1), 45–54 (2005)CrossRefGoogle Scholar
  5. 5.
    Brogi, A., Canal, C., Pimentel, E.: Component Adaptation Through Flexible Subservicing. Science of Computer Programming (2006); A previous version of this work was published as Soft Component Adaptation, ENTCS vol. 85(3), Elsevier (2004)Google Scholar
  6. 6.
    Brown, A.W., Wallnau, K.C.: The Current State of CBSE. IEEE Software 15(5), 37–47 (1998)CrossRefGoogle Scholar
  7. 7.
    Canal, C., Murillo, J.M., Poizat, P.: Coordination and Adaptation Techniques for Software Entities. In: Malenfant, J., Østvold, B.M. (eds.) ECOOP 2004. LNCS, vol. 3344, pp. 133–147. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  8. 8.
    Canal, C., Murillo, J.M., Poizat, P.: Software Adaptation. L’Objet. Special Issue on Coordination and Adaptation Techniques 12(1), 9–31 (2006)Google Scholar
  9. 9.
    Garavel, H., Lang, F., Mateescu, R.: An Overview of CADP 2001. EASST Newsletter 4, 13–24 (2002)Google Scholar
  10. 10.
    Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison Wesley, Reading (1979)MATHGoogle Scholar
  11. 11.
    Inverardi, P., Tivoli, M.: Deadlock Free Software Architectures for COM/DCOM Applications. Journal of Systems and Software 65(3), 173–183 (2003)CrossRefGoogle Scholar
  12. 12.
    Inverardi, P., Tivoli, M.: Software Architecture for Correct Components Assembly. In: Bernardo, M., Inverardi, P. (eds.) SFM 2003. LNCS, vol. 2804, pp. 92–121. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  13. 13.
    Lang, F.: Exp.Open 2.0: A Flexible Tool Integrating Partial Order, Compositional, and On-The-Fly Verification Methods. In: Romijn, J.M.T., Smith, G.P., van de Pol, J. (eds.) IFM 2005. LNCS, vol. 3771, pp. 70–88. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  14. 14.
    Maréchal, O., Poizat, P., Royer, J.-C.: Checking Asynchronously Communicating Components using Symbolic Transition Systems. In: Meersman, R., Tari, Z. (eds.) OTM 2004. LNCS, vol. 3291, pp. 1502–1519. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  15. 15.
    Murata, T.: Petri Nets: Properties, Analysis and Applications. Proceedings of the IEEE 77(4), 541–580 (1989)CrossRefGoogle Scholar
  16. 16.
    Nierstrasz, O., Meijler, T.D.: Research Directions in Software Composition. ACM Computing Surveys 27(2), 262–264 (1995)CrossRefGoogle Scholar
  17. 17.
    Rackoff, C.: The Covering and Boundedness Problems for Vector Addition Systems. Theoretical Computer Science 6, 223–231 (1978)MathSciNetCrossRefMATHGoogle Scholar
  18. 18.
    Schmidt, H.W., Reussner, R.H.: Generating Adapters for Concurrent Component Protocol Synchronization. In: Proc. of the 5th Int. Conf. on Formal Methods for Open Object-Based Distributed Systems (FMOODS 2002), pp. 213–229. Kluwer Academic Publishers, Dordrecht (2002)Google Scholar
  19. 19.
    Südholt, M.: A Model of Components with Non-regular Protocols. In: Gschwind, T., Aßmann, U., Nierstrasz, O. (eds.) SC 2005. LNCS, vol. 3628, pp. 99–113. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  20. 20.
    Szyperski, C.: Component Software: Beyond Object-Oriented Programming. Addison-Wesley, Reading (1998)Google Scholar
  21. 21.
    Yellin, D.M., Strom, R.E.: Protocol Specifications and Components Adaptors. ACM Transactions on Programming Languages and Systems 19(2), 292–333 (1997)CrossRefGoogle Scholar

Copyright information

© IFIP International Federation for Information Processing 2006

Authors and Affiliations

  • Carlos Canal
    • 1
  • Pascal Poizat
    • 2
  • Gwen Salaün
    • 3
  1. 1.Department of Computer ScienceUniversity of MálagaMálagaSpain
  2. 2.IBISC FRE 2873 CNRSUniversity of Évry Val d’Essonne, GenopoleÉvryFrance
  3. 3.VASY project, INRIA Rhône-Alpes, FranceMontbonnot Saint-MartinFrance

Personalised recommendations