A component calculus for modeling the Olan configuration language

  • Jean-Yves Vion-Dury
  • Luc Bellissard
  • Vladimir Marangozov
Regular Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1282)


Components will certainly become a key concept for the next generation of software architectures because of their impact on effective software reuse, real interoperability and integration. Within the Olan project [15], we face the difficulty of defining an operational semantics able to reflect the diversity of execution models involved in real applications. Existing process calculi offer the required abstractions such as encapsulation and process equivalences, but they rely on the fundamental assumption that agents are active, i.e autonomously able to initiate communication. However, components, viewed as software pieces with explicit interfaces, require a notion of passive composition that allows, for instance, several components to be traversed by a same process. In this paper, we introduce a calculus, named ICCS, which extends the Milner's CCS calculus with (1) an operator for passive composition, and (2) selective interactions. While preserving the powerful theory of process equivalences established for CCS, this calculus provides an operational definition of passive components and allows thus to establish the basis of an operational semantics for the Olan Configuration Language.


Composition Operator Operational Semantic Label Transition System Passive Component Execution Model 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    L. Bellissard, S. Ben Atallah, F. Boyer, M. Riveill, “Distributed Application Configuration”, Proc. 16th International Conference on Distributed Computing Systems, pp. 579–585, IEEE Computer Society, Hong-Kong, May 1996.Google Scholar
  2. 2.
    Ichiro Satoh and Mario Tokoro, “A Timed Calculus for Distributed Object with Clocks” Proceedings of the 7th European Conference on Object Oriented Programming, pp. 326–345, Springer-Verlag, Kaiserslautern, Germany, July 1993.Google Scholar
  3. 3.
    Ichiro Satoh and Mario Tokoro, “A Formalism for Distributed Real-Time Processes with Temporal Uncertainties”, Proceedings of OOPSLA'92, ACM, pp.315–326, October 1994.Google Scholar
  4. 4.
    Daniel M. Yellin and Robert E. Strom “Interfaces, Protocols, and the Semi-Automatic Construction of Software Adaptors”, Proceedings of OOPSLA'94 (Portland, Oregon USA), ACM, pp. 176–190, October 1994.Google Scholar
  5. 5.
    Oscar Nierstrasz, “Toward an Object Calculus”, Proceedings of ECOOP'91 Workshop on Object-Based Concurrent Computing — Geneva, LNCS, pp 1–20, July 1991.Google Scholar
  6. 6.
    Hoare C.A.R., “Communicating Sequential Processes”, Communications of ACM, 21(8), 1978.Google Scholar
  7. 7.
    Robert Allen and David Garlan, “Formal Connectors”, Technical Report CMU-CS-94-115, School of Computer Science, Camegie Mellon University, Pittsburgh, PA 15213, March 1994.Google Scholar
  8. 8.
    Jef Magee, Susan Eisenbach and Jeff Kramer, “Modelling Darwin in the π-calculus”, Theory & Practice in Distributed systems, Dagstuhl Castle, Germany, Lecture Notes in computer Sciences 938, September 1994.Google Scholar
  9. 9.
    Robin Milner, Communication and Concurrency, Prentice Hall international, 66 Wood Lane End, Hemel Hempstead Hertfordshire, HP2 4RG UK, 1989.Google Scholar
  10. 10.
    Robin Milner, Joachim Parrow and David Walker, “A Calculus of Mobile Processes (Part 1 & 2)”, LFCS Laboratory for Foundation of Computer Sciences, University of Edinburgh, June 1989.Google Scholar
  11. 11.
    Robin Milner, Joachim Parrow and David Walker, “Modal Logics for Mobile Processes”, LFCS Laboratory for Foundation of Computer Sciences, University of Edinburgh, April 1991.Google Scholar
  12. 12.
    Jean-Yves Vion-Duty, ‘`, Exploratory Compiler and simulator for ICCS, January 1997.Google Scholar
  13. 13.
    De Remer F. and Kron H. “Programming-in-the-large versus Programming-in-the-small”, IEEE Transactions on Software Engineering, Vol. 2 (No. 2), pp. 80–87, June 1976.Google Scholar
  14. 14.
    Simon S. Lam, A.Udaya Shankar, “A Theory of Interfaces and Modules I-Composition Theorem” IEEE Transactions on Software Engineering, Vol. 20, No. 1, January 1994.Google Scholar
  15. 15.
    Bellissard L., Ben Atallah S., Kerbrat A., and Riveill M. “Comonent-based Programming and Application Management with Olan”, Object-Based Parallel and Distributed Computation France-Japan Workshop, OBPDC'95, Briot J.P, Geib J.M., Yonezawa A. (Eds.), LNCS, Vol. 1107, Springer-Verlag, 1996.Google Scholar
  16. 16.
    Magee J., Dulay N. and Kramer J. “A Constructive Development Environment for Parallel and Distributed Programs”, Proceedings of the International Conference on Configurable Distributed Systems, Pittsburgh, PA, March 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Jean-Yves Vion-Dury
    • 1
  • Luc Bellissard
    • 2
  • Vladimir Marangozov
    • 2
  1. 1.Rank Xerox Research CentreMeylanFrance
  2. 2.INRIA Rhône-AlpesSIRAC ProjectMontbonnot Saint MartinFrance

Personalised recommendations