Advertisement

Steps on the Road to Component Evolvability

  • Mario Bravetti
  • Cinzia Di Giusto
  • Jorge A. Pérez
  • Gianluigi Zavattaro
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6921)

Abstract

We have recently developed a calculus for dynamically evolvable aggregations of components. The calculus extends CCS with primitives for describing components and their evolvability capabilities. Central to these novel primitives is a restricted form of higher-order communication of processes involved in update operations. The origins of our calculus for components can indeed be traced back to our own previous work on expressiveness and decidability results for core higher-order process calculi. Here we overview these previous works, and discuss the motivations and design decisions that led us from higher-order process calculi to calculi for component evolvability.

Keywords

Decidability Result Parallel Composition Input Action Label Transition System Dynamic Topology 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.-K.: Algorithmic analysis of programs with well quasi-ordered domains. Inf. Comput. 160(1-2), 109–127 (2000)CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    Bravetti, M., Giusto, C.D., Pérez, J.A., Zavattaro, G.: Adaptable Processes. Technical report, University of Bologna (2011), Draft in, http://www.japerez.phipages.com
  3. 3.
    Di Giusto, C., Pérez, J.A., Zavattaro, G.: On the expressiveness of forwarding in higher-order communication. In: Leucker, M., Morgan, C. (eds.) ICTAC 2009. LNCS, vol. 5684, pp. 155–169. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  4. 4.
    Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theor. Comput. Sci. 256(1-2), 63–92 (2001)CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Hildebrandt, T., Godskesen, J.C., Bundgaard, M.: Bisimulation congruences for homer — a calculus of higher order mobile embedded resources. Technical Report TR-2004-52, IT University of Copenhagen (2004)Google Scholar
  6. 6.
    Lanese, I., Pérez, J.A., Sangiorgi, D., Schmitt, A.: On the expressiveness and decidability of higher-order process calculi. Inf. Comput. 209(2), 198–226 (2011)CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    Milner, R.: Comunication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)Google Scholar
  8. 8.
    Milner, R., Parrow, J., Walker, D.: A Calculus of Mobile Processes, I. Inf. Comput. 100(1), 1–40 (1992)CrossRefzbMATHMathSciNetGoogle Scholar
  9. 9.
    Pérez, J.A.: Higher-Order Concurrency: Expressiveness and Decidability Results. PhD thesis, University of Bologna (2010), Draft in, http://www.japerez.phipages.com
  10. 10.
    Sangiorgi, D.: Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis CST–99–93, University of Edinburgh, Dept. of Comp. Sci. (1992)Google Scholar
  11. 11.
    Schmitt, A., Stefani, J.-B.: The kell calculus: A family of higher-order distributed process calculi. In: Priami, C., Quaglia, P. (eds.) GC 2004. LNCS, vol. 3267, pp. 146–178. Springer, Heidelberg (2005)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Mario Bravetti
    • 1
  • Cinzia Di Giusto
    • 2
  • Jorge A. Pérez
    • 3
  • Gianluigi Zavattaro
    • 1
  1. 1.Laboratory FOCUSUniversità di Bologna / INRIAItaly
  2. 2.INRIA Grenoble - Rhône-AlpesFrance
  3. 3.CITI - Department of Computer ScienceFCT New University of LisbonPortugal

Personalised recommendations