Advertisement

Automated Two-Phase Composition of Timed Web Services

  • Maciej Szreter
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9609)

Abstract

The paper extends PlanICS web services composition system by augumenting services with an explicit notion of time, and evolution of variables as a function of time. Its distinguishing feature is focusing not only on time constraints in services, but covering the whole service definition and composition process: providing an ontology with a strong type system on which definitions of typed stateless timed services are based, timed user queries, offers from service providers corresponding to instances of service types, and searching for services and offers matching the user query. A novel idea is that services express their timed behavior by producing timed automata as a part of their output. Abstract and concrete planning is described, dealing respectively with service types (including time dependencies), and with offer sets corresponding to these types.

Keywords

Dynamic Variable Service Composition Service Type User Query Dynamic Service 
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.

References

  1. 1.
    Doliwa, D., Horzelski, W., Jarocki, M., Niewiadomski, A., Penczek, W., Polrola, A., Szreter, M., Zbrzezny, A.: PlanICS - a web service composition toolset. Fundam. Inform. 112, 47–71 (2011)zbMATHGoogle Scholar
  2. 2.
    Roman, D., de Bruijn, J., Mocan, A., Lausen, H., Domingue, J., Bussler, C.J., Fensel, D.: WWW: WSMO, WSML, and WSMX in a nutshell. In: Mizoguchi, R., Shi, Z.-Z., Giunchiglia, F. (eds.) ASWC 2006. LNCS, vol. 4185, pp. 516–522. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  3. 3.
    Kazhamiakin, R., Pandya, P., Pistore, M.: Timed modelling and analysis inweb service compositions. In: Proceedings of the First International Conference on Availability, Reliability and Security. ARES 2006, pp. 840–846 (2006)Google Scholar
  4. 4.
    Lallali, M., Zaidi, F., Cavalli, A.: Timed modeling of web services composition for automatic testing. In: Proceedings of the of SITIS 2007, pp. 417–426 (2007)Google Scholar
  5. 5.
    Bertoli, P., Pistore, M., Traverso, P.: Automated composition of web services via planning in asynchronous domains. Artif. Intell. 174, 316–361 (2010)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Guermouche, N., Godart, C.: Composition of web services: from qualitative to quantitative timed properties. In: Bouguettaya, A., Sheng, Q.Z., Daniel, F. (eds.) Web Services Foundations, pp. 399–422. Springer, Heidelberg (2014). Rapport LAAS nr 14012CrossRefGoogle Scholar
  7. 7.
    Stöhr, D., Glesner, S.: Automated composition of timed services by planning as model checking. In: Proceedings of ZEUS-12, pp. 34–41 (2012)Google Scholar
  8. 8.
    Du, Y., Tan, W., Zhou, M.: Timed compatibility analysis of web service composition: a modular approach based on Petri Nets. IEEE T. Autom. Sci. Eng. 11, 594–606 (2014)CrossRefGoogle Scholar
  9. 9.
    Jingjing, H., Zhu Wei, Z.X., Dongfeng, Z.: Web service composition automation based on timed automata. (Applied Mathematics and Information Sciences)Google Scholar
  10. 10.
    Dong, J., Liu, Y., Sun, J., Zhang, X.: Towards verification of computation orchestration. Formal Aspects of Comput. 26, 729–759 (2014)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Niewiadomski, A., Penczek, W.: SMT-based abstract temporal planning. In: Proceedings of the International Workshop on Petri Nets and Software Engineering, Tunis, Tunisia, June 23–24, 2014, pp. 55–74 (2014)Google Scholar
  12. 12.
    Niewiadomski, A., Skaruz, J., Penczek, W., Szreter, M., Jarocki, M.: SMT versus genetic and OpenOpt algorithms: concrete planning in the PlanICS framework. Fundam. Inform. 135, 451–466 (2014)MathSciNetzbMATHGoogle Scholar
  13. 13.
    Zbrzezny, A., Półrola, A.: SAT-based reachability checking for timed automata with discrete data. Fundam. Inform. 70(1–2), 579–593 (2007)MathSciNetzbMATHGoogle Scholar
  14. 14.
    Behrmann, G., David, A., Larsen, K., Håkansson, J., Pettersson, P., Yi, W., Hendriks, M.: UPPAAL 4.0. In: QEST. IEEE Computer Society 125–126 (2006)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Institute of Computer SciencePolish Academy of SciencesWarsawPoland

Personalised recommendations