On Nondeterministic Workflow Executions

  • Alexandra Potapova
  • Jianwen Su
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6551)


The ability to compose existing services to form new functionality is one of the most promising ideas enabled by SOA and the framework of (web) services. A composition or a workflow often involves services distributed over a network and possibly many organizations and administrative domains. Nondeterminism could occur in a composition in at least two ways. The first form is the result of modeling abstraction that hides the detail information and thus makes the “computation” appear non-deterministic. The second form is closely related to “operational optimization”, e.g., one may try to invoke more than multiple services for a task, whichever completes first will produce the result and preempts all other services. In this paper, we focus on the latter and measure the complexity of service execution as the amount of needed resources and controlling mechanism for executing nondeterministic service compositions. We formalize the model and complexity problem and develop technical results for this problem in the general setting as well as special cases.


State Machine Service Composition Terminal Node Regular Language Topological Order 
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.
    Berardi, D., Calvanese, D., De Giacomo, G., Mecella, M.: Composition of services with nondeterministic observable behavior. In: Benatallah, B., Casati, F., Traverso, P. (eds.) ICSOC 2005. LNCS, vol. 3826, pp. 520–526. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  2. 2.
    Berardi, D., Calvanese, D., De Giacomo, G., Lenzerini, M., Mecella, M.: Automatic composition of e-services that export their behavior. In: Orlowska, M.E., Weerawarana, S., Papazoglou, M.P., Yang, J. (eds.) ICSOC 2003. LNCS, vol. 2910, pp. 43–58. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  3. 3.
    Berardi, D., De Giacomo, G., Mecella, M., Calvanese, D.: Composing web services with nondeterministic behavior. In: Proc. IEEE Int. Conf. Web Services, ICWS (2006)Google Scholar
  4. 4.
    Finkel, A.: The minimal coverability graph for petri nets. In: Proc. 12th Int. Conf. on Applications and Theory of Petri Nets: Advances in Petri Nets, pp. 210–243 (1991)Google Scholar
  5. 5.
    Gerede, C., Hull, R., Ibarra, O., Su, J.: Automated composition of e-services: Lookaheads. In: Proc. 2nd Int. Conf. on Service-Oriented Computing, ICSOC (2004)Google Scholar
  6. 6.
    Hackmann, G., Haitjema, M., Gill, C., Roman, G.-C.: Silver: A BPEL workflow process execution engine for mobile devices. In: Proc. Int. Conf. Service Oriented Computing, ICSOC (2006)Google Scholar
  7. 7.
    Han, Y.-S., Wang, Y., Wood, D.: Prefix-free regular languages and pattern matching. Theoretical Computer Science 389, 307–317 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)zbMATHGoogle Scholar
  9. 9.
    Hull, R., Benedikt, M., Christophides, V., Su, J.: E-services: A look behind the curtain. In: Proc. ACM Symp. on Principles of Database Systems (2003)Google Scholar
  10. 10.
    Hull, R., Su, J.: Tools for composite web services: A short overview. SIGMOD Record 34(2), 86–95 (2005)CrossRefGoogle Scholar
  11. 11.
    Lemcke, J., Friesen, A.: Composing web-service-like abstract state machines (asms). In: Proc. IEEE Congress on Services, SERVICES (2007)Google Scholar
  12. 12.
    Liu, G., Liu, X., Qin, H., Su, J., Yan, Z., Zhang, L.: Automated realization of business workflow specification. In: Proc. Int. Workshop on SOA, Globalization, People, and Work (2009)Google Scholar
  13. 13.
    Petri, C.A.: Fundamentals of a theory of asynchronous information flow. In: Proc. of IFIP Congress 1962, pp. 386–390. North Holland Publ. Comp., Amsterdam (1963)Google Scholar
  14. 14.
    Rackoff, C.: The covering and boundedness problems for vector addition systems. Theoretical Computer Science (1978)Google Scholar
  15. 15.
    Sakata, Y., Yokoyama, K., Matsuda, S.: A method for composing process of non-deterministic web services. In: Proc. IEEE Int. Conf. Web Services, ICWS (2004)Google Scholar
  16. 16.
    Su, J.: Special Issue on Semantic Web Services: Composition and Analysis. IEEE Data Eng. Bull. 31(3) (September 2008),
  17. 17.
    van der Aalst, W.M.P., ter Hofstede, A.H.M.: YAWL: yet another workflow language. Information Systems 30(4), 245–275 (2005)CrossRefGoogle Scholar
  18. 18.
    Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Word, Language, Grammar. Handbook of Formal Languages, vol. 1, pp. 41–110. Springer, Heidelberg (1997)Google Scholar
  19. 19.
    Zeng, L., Flaxer, D., Chang, H., Jeng, J.-J.: PLM\(_{\textit{flow}}\)-Dynamic business process composition and execution by rule inference. In: Proc. 3rd Int. Workshop on Technologies for E-Services (TES). Springer, Heidelberg (2002)Google Scholar
  20. 20.
    Zhang, X., Junqueira, F., Hiltunen, M.A., Marzullo, K., Schlichting, R.D.: Replicating nondeterministic services on grid environments. In: Proc. 15th IEEE Int. Symp. on High Performance Distributed Computing (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Alexandra Potapova
    • 1
  • Jianwen Su
    • 1
  1. 1.Department of Computer ScienceUniversity of CaliforniaSanta BarbaraUSA

Personalised recommendations