Steps on the Road to Component Evolvability
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.
KeywordsDecidability Result Parallel Composition Input Action Label Transition System Dynamic Topology
Unable to display preview. Download preview PDF.
- 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
- 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
- 7.Milner, R.: Comunication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)Google Scholar
- 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.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