Adaptable Transition Systems @ ASCENS Meeting Prague 2013

399 views
334 views

Published on

My talk on "Adaptable Transition Systems" on the ASCENS general meeting at Prague (February 2013).

0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total views
399
On SlideShare
0
From Embeds
0
Number of Embeds
3
Actions
Shares
0
Downloads
3
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

Adaptable Transition Systems @ ASCENS Meeting Prague 2013

  1. 1. Adaptable T ´´ ransition Systems -- Roberto Bruni, UNIPI -- Andrea Corradini, UNIPI -- Fabio Gadducci, UNIPI -- Alberto Lluch Lafuente, IMT -- Andrea Vandin, IMT ASCENS General and Working Meeting, Prague, February 11-14 2013
  2. 2. adap tation is a game
  3. 3. OUTLINE1 White box adaptation “A Conceptual Framework for Adaptation” [FASE 2012]2 Adaptable Transition Systems “Adaptable Transition Systems” [WADT 2012]
  4. 4. OUTLINE1 White box adaptation “A Conceptual Framework for Adaptation” [FASE 2012]2 Adaptable Transition Systems “Adaptable Transition Systems” [WADT 2012]
  5. 5. What isadaptation?
  6. 6. “... a software system self-adaptive if changes behavior in response to ...” [*] Oreizy, P., Gorlick, M.M., Taylor, R.N., Heimbigner, D., Johnson, G., Medvidovic, N., Quilici, A., Rosenblum, D.S., Wolf, A.L.: An architecture-based approach to self- adaptive software. Intelligent Systems and their Applications 14(3), 54–62 (1999) [*] Robertson, P., Shrobe, H.E., Laddaga, R.: Introduction to self-adaptive software: Applications. In: Robertson, P., Shrobe, H.E., Laddaga, R. (eds.) IWSAS. LNCS, vol. 1936, pp. 1–5. Springer (2001) [*] Self-Adaptive Software: Landscape and Research Challenges, Mazeiar Salehie, Ladan Tahvildari, ACM Transactions on Autonomous and Adaptive Systems 4, 2.
  7. 7. Lotfi A. Zadeh,Proc. IEEE, 1963
  8. 8. BLACK-BOX ADAPTATION
  9. 9. White boxadaptation
  10. 10. ADAPTATION MECHANISMS constraints contracts plans aspects architectures messages contexts rulesconfigurationvariables policies programs CONTROL DATA
  11. 11. WHAT IS AN ADAPTABLE SYSTEM? CONTROL DATA OTHER DATA ADAPTABLE SYSTEM“adaptation is the run-time modification of control data”
  12. 12. A SYSTEM IS...“...adaptable if it has a distinguished control datathat can be modified at runtime.”“...adaptive if its control data is modified at runtimefor some computation.”“...self-adaptive if it modifies its own control data atruntime.”
  13. 13. “an excellent discussion of the precise meaning of the term adaptive software.” - Carlo Ghezzi, Evolution, Adaptation, and the Quest for Incrementality, LNCS 7539/2012,
  14. 14. OUTLINE1 White box adaptation “A Conceptual Framework for Adaptation” [FASE 2012]2 Adaptable Transition Systems “Adaptable Transition Systems” [WADT 2012]
  15. 15. task? task?D{}[] D{}[t] D{}[tt] down! up! up! task? task?U{}[] U{}[t] U{}[tt] schedule! schedule! finish! finish! U{t}[] U{t}[t] task?
  16. 16. task? task?D{}[] D{}[t] D{}[tt] down! up! up! task? task?U{}[] U{}[t] U{}[tt] schedule! schedule! finish! Is it s finish!elf U{t}[] da task? pti v e? U{t}[t] a
  17. 17. task? task?D{}[] D{}[t] D{}[tt] down! up! up! task? task?U{}[] U{}[t] U{}[tt] schedule! schedule! finish! finish! U{t}[] U{t}[t] task?
  18. 18. task? task?D{}[] D{}[t] D{}[tt] down! up! up! task? task?U{}[] U{}[t] U{}[tt] schedule! schedule! finish! finish! U{t}[] U{t}[t] task?
  19. 19. task? task?D{}[] D{}[t] D{}[tt] ffer ent di down! up! up! ,140 = 4 U{}[t] task?ions! B 8 task?U{}[] at U{}[tt] ret schedule! int erp schedule! finish! finish! U{t}[] U{t}[t] task?
  20. 20. Interface Automatain a nutshell
  21. 21. IA = Automata + Interface (i/o distinction) task? task? down! up! up! task? task? schedule! schedule!finish! finish! task
  22. 22. IA = Automata + Interface (i/o distinction) task? task? down! up! up! task? task? schedule! schedule!finish! finish! task?
  23. 23. task? task? D {} [] [t] [tt] schedule?up! schedule! schedule! down! finish! U {t}
  24. 24. task? task? D {} [] [t] [tt] schedule?up! schedule! schedule! down! finish! U {t} task? task? {}[] {}[t] {}[tt] finish! finish! finish! task? task? {t}[] {t}[t] {t}[tt]
  25. 25. task? task? D {} [] [t] [tt] schedule?up! schedule! schedule! down! finish! U {t} task? task? {}[] {}[t] {}[tt] schedule! schedule!schedule? finish! finish! finish! task? task? {t}[] {t}[t] {t}[tt] schedule! schedule!
  26. 26. AdaptableInterfaceAutomata
  27. 27. task? task? down! up! up! task? task? schedule! schedule!finish! finish! task? AIA = IA + control propositions (colors)
  28. 28. task? task? down! up! up! task? task? schedule! schedule!finish! finish! task? AIA = IA + control propositions (colors)
  29. 29. ExploitingControl Data
  30. 30. AUTONOMIC MANAGER Analyze Plan task? task? D{}[] D{}[t] D{}[tt] Knowledge Execute down! up! up!Monitor task? task? U{}[] U{}[t] U{}[tt] MANAGED COMPONENT schedule! schedule! finish! finish! U{t}[] U{t}[t] task?
  31. 31. AUTONOMIC MANAGER Analyze Plan task? task? D{}[] D{}[t] D{}[tt] Knowledge Execute down! up! up!Monitor task? task? U{}[] U{}[t] U{}[tt] MANAGED COMPONENT schedule! schedule! finish! finish! U{t}[] U{t}[t] task?
  32. 32. some behavioural relation
  33. 33. normal output actions become inputs (M “listens” outputs of B)
  34. 34. task? task?D{}[] D{}[t] D{}[tt] down! up! up! task? task?U{}[] U{}[t] U{}[tt] schedule! schedule! finish? finish! U{t}[] U{t}[t] task?
  35. 35. task? task?D{}[] D{}[t] D{}[tt] down! up! up! task? task?U{}[] U{}[t] U{}[tt] schedule? schedule? finish? finish? U{t}[] U{t}[t] task?
  36. 36. control output actions become inputs (B “obeys” outputs of M)
  37. 37. task? task?D{}[] D{}[t] D{}[tt] down! up! up! task? task?U{}[] U{}[t] U{}[tt] schedule! schedule! finish! finish! U{t}[] U{t}[t] task?
  38. 38. task? task?D{}[] D{}[t] D{}[tt] down? up? up? task? task?U{}[] U{}[t] U{}[tt] schedule! schedule! finish! finish! U{t}[] U{t}[t] task?
  39. 39. ISO (for deterministic AIA)
  40. 40. BeyondIsomorphism
  41. 41. control output actions become inputs(B “obeys” outputs of M)collapse transitions labelled with B(M “ignores” B-moves)
  42. 42. task? task?D{}[] D{}[t] D{}[tt] down! up! up! task? task?U{}[] U{}[t] U{}[tt] schedule? schedule? finish? finish? U{t}[] U{t}[t] task?
  43. 43. task? task?D{}[] D{}[t] D{}[tt] down! up! up! task? task?U{}[] U{}[t] U{}[tt] finish? finish?
  44. 44. alternating simulation
  45. 45. (for deterministic IA)
  46. 46. Conclusion
  47. 47. OUTLINE1 White box adaptation “A Conceptual Framework for Adaptation” [FASE 2012]2 Adaptable Transition Systems “Adaptable Transition Systems” [WADT 2012]
  48. 48. adap tation is a game
  49. 49. RECONCILING BLACK- AND WHITE-BOX ADAPTATION?“in the game between the system and the environment, the manager has a strategy to ensure the satisfaction of ψ.”“receptiveness, realizability, and controllability can be formulated as model-checking problems for alternating-time formulas.”
  50. 50. THANKS!

×