Constructing Replaceable Services Using Operating Guidelines and Maximal Controllers

  • Arjan J. Mooij
  • Jarungjit Parnjai
  • Christian Stahl
  • Marc Voorhoeve
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6551)


Service-oriented systems support process evolution by allowing the replacement of a service S by another service T. To maintain proper interaction in the overall system, service T should interact properly with all controllers (i.e., in all contexts) of service S.

To support the construction of such services T, we compute operating guidelines that represent all services that can replace service S. Our computation relies on the additional notion of a maximal controller. Maximal controllers can also be used for deciding whether a service T can replace service S, and for computing a public view that hides service details that are not relevant for controllers.


Service Composition Outgoing Edge Controllable Service Satisfying Assignment Public View 
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.
    van der Aalst, W.M.P., Lohmann, N., Massuthe, P., Stahl, C., Wolf, K.: From public views to private views – correctness-by-design for services. In: Dumas, M., Heckel, R. (eds.) WS-FM 2007. LNCS, vol. 4937, pp. 139–153. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  2. 2.
    van der Aalst, W.M.P., Weske, M.: The P2P approach to interorganizational workflows. In: Dittrich, K.R., Geppert, A., Norrie, M.C. (eds.) CAiSE 2001. LNCS, vol. 2068, pp. 140–156. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  3. 3.
    Backhouse, R.: Galois connections and fixed point calculus. In: Blackhouse, R., Crole, R.L., Gibbons, J. (eds.) Algebraic and Coalgebraic Methods in the Mathematics of Program Construction. LNCS, vol. 2297, pp. 89–148. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  4. 4.
    Benatallah, B., Casati, F., Toumani, F.: Representing, Analysing and Managing Web Service Protocols. Data Knowl. Eng. 58(3), 327–357 (2006)CrossRefGoogle Scholar
  5. 5.
    Bonchi, F., Brogi, A., Corfini, S., Gadducci, F.: A net-based approach to web services publication and replaceability. Fundam. Inform. 94(3-4), 305–330 (2009)MathSciNetzbMATHGoogle Scholar
  6. 6.
    Bravetti, M., Tennenholtz, M.: Contract based multi-party service composition. In: Arbab, F., Sirjani, M. (eds.) FSEN 2007. LNCS, vol. 4767, pp. 207–222. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  7. 7.
    Brinksma, E.: A theory for the derivation of tests. In: Protocol Specification, Testing, and Verification VIII, pp. 63–74. North-Holland, Amsterdam (1988)Google Scholar
  8. 8.
    Castagna, G., Dezani-Ciancaglini, M., Giachino, E., Padovani, L.: Foundations of session types. In: PPDP 2009, pp. 219–230. ACM, New York (2009)Google Scholar
  9. 9.
    Dill, D.L.: Trace theory for automatic hierarchical verification of speed-independent circuits. MIT Press, Cambridge (1989)Google Scholar
  10. 10.
    Eshuis, R., Grefen, P.W.P.J.: Composing services into structured processes. Int. J. Cooperative Inf. Syst. 18(2), 309–337 (2009)CrossRefGoogle Scholar
  11. 11.
    Fournet, C., Hoare, S.T., Rajamani, S.K., Rehof, J.: Stuck-free conformance. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 242–254. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  12. 12.
    van Hee, K., Mooij, A.J., Sidorova, N., van der Werf, J.M.: Soundness-preserving refinements of service compositions. In: Bravetti, M., Bultan, T. (eds.) WS-FM 2010. LNCS, vol. 6551, pp. 131–145. Springer, Heidelberg (2010)Google Scholar
  13. 13.
    Hoare, C.A.R.: Communicating sequential processes. Prentice-Hall International series in computing science. Prentice-Hall, Englewood Cliffs (1985)zbMATHGoogle Scholar
  14. 14.
    König, D., Lohmann, N., Moser, S., Stahl, C., Wolf, K.: Extending the compatibility notion for abstract WS-BPEL processes. In: WWW 2008, pp. 785–794. ACM, New York (2008)Google Scholar
  15. 15.
    Laneve, C., Padovani, L.: The must preorder revisited. In: Caires, L., Li, L. (eds.) CONCUR 2007. LNCS, vol. 4703, pp. 212–225. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  16. 16.
    Leymann, F., Roller, D., Schmidt, M.: Web services and business process management. IBM Systems Journal 41(2), 198–211 (2002)CrossRefGoogle Scholar
  17. 17.
    Lohmann, N.: Correcting deadlocking service choreographies using a simulation-based graph edit distance. In: Dumas, M., Reichert, M., Shan, M.-C. (eds.) BPM 2008. LNCS, vol. 5240, pp. 132–147. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  18. 18.
    Lohmann, N., Massuthe, P., Wolf, K.: Behavioral constraints for services. In: Alonso, G., Dadam, P., Rosemann, M. (eds.) BPM 2007. LNCS, vol. 4714, pp. 271–287. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  19. 19.
    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
  20. 20.
    Milner, R.: Communication and concurrency. Prentice-Hall, Englewood Cliffs (1989)zbMATHGoogle Scholar
  21. 21.
    Mooij, A.J., Voorhoeve, M.: Proof techniques for adapter generation. In: Bruni, R., Wolf, K. (eds.) WS-FM 2008. LNCS, vol. 5387, pp. 207–223. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  22. 22.
    Mooij, A.J., Voorhoeve, M.: Trading off concurrency to generate behavioral adapters. In: ACSD 2009, pp. 109–118. IEEE, Los Alamitos (2009)Google Scholar
  23. 23.
    Murata, T.: Petri nets: Properties, analysis and applications. Proc. of the IEEE 77(4), 541–580 (1989)CrossRefGoogle Scholar
  24. 24.
    Papazoglou, M.P.: The challenges of service evolution. In: Bellahsène, Z., Léonard, M. (eds.) CAiSE 2008. LNCS, vol. 5074, pp. 1–15. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  25. 25.
    Park, D.: Concurrency and automata on infinite sequences. In: Proc. of the 5th GI-Conference on Theoretical Computer Science, pp. 167–183. Springer, Heidelberg (1981)CrossRefGoogle Scholar
  26. 26.
    Parnjai, J., Stahl, C., Wolf, K.: A finite representation of all substitutable services and its applications. In: ZEUS 2009, vol. 438, pp. 8–14. CEUR (March 2009)Google Scholar
  27. 27.
    Stahl, C., Massuthe, P., Bretschneider, J.: Deciding Substitutability of Services with Operating Guidelines. ToPNoC II 2(5460), 172–191 (2009)zbMATHGoogle Scholar
  28. 28.
    Stahl, C., Wolf, K.: Covering places and transitions in open nets. In: Dumas, M., Reichert, M., Shan, M.-C. (eds.) BPM 2008. LNCS, vol. 5240, pp. 116–131. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  29. 29.
    Vogler, W.: Modular Construction and Partial Order Semantics of Petri Nets. LNCS, vol. 625. Springer, Heidelberg (1992)zbMATHGoogle Scholar
  30. 30.
    Wolf, K.: Does my service have partners? ToPNoC 5460(II), 152–171 (2009); special Issue on Concurrency in Process-Aware Information SystemszbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Arjan J. Mooij
    • 1
  • Jarungjit Parnjai
    • 2
  • Christian Stahl
    • 1
  • Marc Voorhoeve
    • 1
  1. 1.Department of Mathematics and Computer ScienceTechnische Universiteit EindhovenThe Netherlands
  2. 2.Institut für InformatikHumboldt-Universität zu BerlinBerlinGermany

Personalised recommendations