Towards the Verification of Adaptable Processes

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


In prior work, with the aim of formally modeling and analyzing the behavior of concurrent processes with forms of dynamic evolution, we have proposed a process calculus of adaptable processes. Our proposal addressed the (un)decidability of two safety properties related to error occurrence. In order to allow for a more comprehensive verification framework for adaptable processes, the ability to express general properties is most desirable. In this paper we address this important issue: we explain how the proof techniques for (un)decidability results for adaptable processes generalize to a simple yet expressive temporal logic over adaptable processes. We provide examples of the expressiveness of the logic and its significance in relation with the calculus of adaptable processes.


Cloud Computing Adaptable Process Decidability Result Safety Property Label Transition System 
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.
    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)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Acciai, L., Boreale, M., Zavattaro, G.: On the Relationship between Spatial Logics and Behavioral Simulations. In: Ong, L. (ed.) FOSSACS 2010. LNCS, vol. 6014, pp. 146–160. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  3. 3.
    Amazon Web Services. Autoscaling (2011),
  4. 4.
    Bravetti, M., Di Giusto, C., Pérez, J.A., Zavattaro, G.: Adaptable processes. Technical report, University of Bologna (2011),
  5. 5.
    Bravetti, M., Di Giusto, C., Pérez, J.A., Zavattaro, G.: Adaptable Processes (Extended Abstract). In: Bruni, R., Dingel, J. (eds.) FORTE 2011 and FMOODS 2011. LNCS, vol. 6722, pp. 90–105. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  6. 6.
    Bundgaard, M., Godskesen, J.C., Hildebrandt, T.: 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. 7.
    Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theor. Comput. Sci. 256(1-2), 63–92 (2001)MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    Milner, R.: Comunication and Concurrency. Prentice Hall (1989)Google Scholar
  9. 9.
    Milner, R., Parrow, J., Walker, D.: A Calculus of Mobile Processes, I. Inf. Comput. 100(1), 1–40 (1992)MathSciNetzbMATHCrossRefGoogle Scholar
  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 FOCUS(Università di Bologna / INRIA)Italy
  2. 2.CEA, LISTFrance
  3. 3.CITI - Dept. of Computer ScienceFCT New University of LisbonPortugal

Personalised recommendations