Synthesizing Cost-Minimal Partners for Services

  • Jan Sürmeli
  • Marvin Triebel
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8274)

Abstract

Adapter synthesis bridges incompatibilites between loosely coupled, stateful services. Formally, adapter synthesis reduces to partner synthesis. Beside an adapter, a partner could be a configurator or serve as an ingredient in solutions for discovery and substitution. We synthesize a cost-minimal partner for a given service based on additional behaviorial constraints. We consider the worst case total costs, specifying individual transition costs as natural numbers. In this paper, we sketch our formal approach, and briefly discuss our implementation.

Keywords

Service-orientation partner synthesis controller synthesis adaptation non-functional properties cost-optimization formal methods 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Papazoglou, M.P.: Web Services: Principles and Technology. Pearson - Prentice Hall, Essex (2007)Google Scholar
  2. 2.
    Gierds, C., Mooij, A.J., Wolf, K.: Reducing adapter synthesis to controller synthesis. IEEE T. Services Computing 5(1), 72–85 (2012)CrossRefGoogle Scholar
  3. 3.
    van der Aalst, W.M.P., Lohmann, N., Rosa, M.L.: Ensuring correctness during process configuration via partner synthesis. Inf. Syst. 37(6), 574–592 (2012)CrossRefGoogle Scholar
  4. 4.
    Lohmann, N., Massuthe, P., Wolf, K.: Operating guidelines for finite-state services. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN 2007. LNCS, vol. 4546, pp. 321–341. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  5. 5.
    Stahl, C., Massuthe, P., Bretschneider, J.: Deciding substitutability of services with operating guidelines. In: Jensen, K., van der Aalst, W.M.P. (eds.) ToPNoC II. LNCS, vol. 5460, pp. 172–191. Springer, Heidelberg (2009)Google Scholar
  6. 6.
    Papazoglou, M.P.: What’s in a Service? In: Oquendo, F. (ed.) ECSA 2007. LNCS, vol. 4758, pp. 11–28. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  7. 7.
    Wolf, K.: Does my service have partners? In: Jensen, K., van der Aalst, W.M.P. (eds.) ToPNoC II. LNCS, vol. 5460, pp. 152–171. Springer, Heidelberg (2009)Google Scholar
  8. 8.
    Sürmeli, J.: Service discovery with cost thresholds. In: ter Beek, M.H., Lohmann, N. (eds.) WS-FM 2012. LNCS, vol. 7843, pp. 30–48. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  9. 9.
    Reisig, W.: Petri Nets: An Introduction. Monographs in Theoretical Computer Science. An EATCS Series, vol. 4. Springer (1985)Google Scholar
  10. 10.
    Sürmeli, J., Triebel, M.: Cost-optimizing compositions of services - analysis and synthesis. Informatik-Berichte 242, Humboldt-Universität zu Berlin (2013)Google Scholar
  11. 11.
    Lohmann, N., Weinberg, D.: Wendy: A tool to synthesize partners for services. Fundam. Inform. 113(3-4), 295–311 (2011)MathSciNetGoogle Scholar
  12. 12.
    Wolf, K.: Generating petri net state spaces. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN 2007. LNCS, vol. 4546, pp. 29–42. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  13. 13.
    Lohmann, N., Massuthe, P., Stahl, C., Weinberg, D.: Analyzing interacting ws-bpel processes using flexible model generation. Data Knowl. Eng. 64(1), 38–54 (2008)CrossRefGoogle Scholar
  14. 14.
    Alves, A., et al.: Web services business process execution language version 2.0 (2007)Google Scholar
  15. 15.
    Fisteus, J.A., Fernández, L.S., Kloos, C.D.: Applying model checking to bpel4ws business collaborations. In: Proceedings of the 2005 ACM Symposium on Applied Computing, SAC 2005, pp. 826–830. ACM, New York (2005)Google Scholar
  16. 16.
    Dijkstra, E.W.: Hierarchical ordering of sequential processes. Acta Inf. 1, 115–138 (1971)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Droste, M., Kuich, W., Vogler, H.: Handbook of Weighted Automata, 1st edn. Springer Publishing Company, Incorporated (2009)Google Scholar
  18. 18.
    Buchholz, P., Kemper, P.: Model checking for a class of weighted automata. Discrete Event Dynamic Systems 20, 103–137 (2010)MathSciNetCrossRefMATHGoogle Scholar
  19. 19.
    Bouyer, P., Brihaye, T., Markey, N.: Improved undecidability results on weighted timed automata. Information Processing Letters 98(5), 188–194 (2006)MathSciNetCrossRefMATHGoogle Scholar
  20. 20.
    Chothia, T., Kleijn, J.: Q-automata: Modelling the resource usage of concurrent components. Electronic Notes in Theoretical Computer Science 175(2), 153–167 (2007); Proceedings of the Fifth International Workshop on the Foundations of Coordination Languages and Software Architectures (FOCLASA 2006)Google Scholar
  21. 21.
    Oster, Z.J., Ali, S.A., Santhanam, G.R., Basu, S., Roop, P.S.: A service composition framework based on goal-oriented requirements engineering, model checking, and qualitative preference analysis. In: Liu, C., Ludwig, H., Toumani, F., Yu, Q. (eds.) ICSOC 2012. LNCS, vol. 7636, pp. 283–297. Springer, Heidelberg (2012)Google Scholar
  22. 22.
    Zeng, L., Benatallah, B., Ngu, A.H.H., Dumas, M., Kalagnanam, J., Chang, H.: QoS-Aware Middleware for Web Services Composition. IEEE Trans. Software Eng. 30(5), 311–327 (2004)CrossRefGoogle Scholar
  23. 23.
    Abdulla, P.A., Mayr, R.: Minimal Cost Reachability/Coverability in Priced Timed Petri Nets. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol. 5504, pp. 348–363. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  24. 24.
    Zwick, U., Paterson, M.: The complexity of mean payoff games on graphs. Theoretical Computer Science 158, 343–359 (1996)MathSciNetCrossRefMATHGoogle Scholar
  25. 25.
    Brim, L., Chaloupka, J., Doyen, L., Gentilini, R., Raskin, J.F.: Faster algorithms for mean-payoff games. Form. Methods Syst. Des. 38(2), 97–118 (2011)CrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Jan Sürmeli
    • 1
  • Marvin Triebel
    • 1
  1. 1.Institut für InformatikHumboldt-Universität zu BerlinBerlinGermany

Personalised recommendations