Skip to main content

Towards a Calculus for Collection-Oriented Scientific Workflows with Side Effects

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5331))

Abstract

In this paper we propose a calculus that can be used to describe the semantics of collection-oriented scientific workflow systems such as the Taverna workbench. Typically such systems focus on the specification and execution of workflows with a relatively simple control flow and a more complex data flow that involves large nested collections of data. An essential operation in such workflows is the instantiation of a certain nested workflow for each element of a collection. We argue that if such workflows call external services, their semantics must be described not only in terms of input-output behavior but also take side effects into account. Based on this assumption a trace semantics is defined that corresponds to the observational equivalence of two workflow specifications. We show that under such a semantics a relatively small calculus with a structural semantics can be defined and used to describe such workflows. This is demonstrated by giving a translation of Taverna workflows in terms of this calculus.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. University of Virginia: FASTA Sequence Comparison, http://wrpmg5c.bioch.virginia.edu/fasta_www2/fasta_list2.shtml

  2. National Center for Biotechnology Information: NCBI Blast, http://www.ncbi.nlm.nih.gov/blast/Blast.cgi

  3. Hull, D., Wolstencroft, K., Stevens, R., Goble, C., Pocock, M.R., Li, P., Oinn, T.: Taverna: a tool for building and running workflows of services. Nucl. Acids Res. 34, W729–732 (2006)

    Article  Google Scholar 

  4. Ludäscher, B., Altintas, I., Berkley, C., Higgins, D., Jaeger, E., Jones, M., Lee, E.A., Tao, J., Zhao, Y.: Scientific workflow management and the kepler system: Research articles. Concurr. Comput.: Pract. Exper. 18, 1039–1065 (2006)

    Article  Google Scholar 

  5. Benson, D.A., Karsch-Mizrachi, I., Lipman, D.J., Ostell, J., Wheeler, D.L.: Genbank. Nucleic Acids Res. 36 (2008)

    Google Scholar 

  6. Rice, P., Longden, I., Bleasby, A.: EMBOSS: the European Molecular Biology Open Software Suite. Trends in Genetics 16, 276–277 (2000)

    Article  Google Scholar 

  7. Turi, D., Missier, P., Goble, C., De Roure, D., Oinn, T.: Taverna workflows: Syntax and semantics. In: IEEE International Conference on e-Science and Grid Computing, pp. 441–448 (2007)

    Google Scholar 

  8. Liu, X., Lee, E.A.: CPO semantics of timed interactive actor networks. Technical Report UCB/EECS-2007-131, EECS Department, University of California, Berkeley (2007)

    Google Scholar 

  9. Lee, E.A., Sangiovanni-Vincentelli, A.: Comparing models of computation. In: ICCAD 1996: Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design, Washington, DC, USA, pp. 234–241. IEEE Computer Society, Los Alamitos (1996)

    Google Scholar 

  10. Singh, M.P., Meredith, G., Tomlinson, C., Attie, P.C.: An event algebra for specifying and scheduling workflows. In: Proceedings of the 4th International Conference on Database Systems for Advanced Applications (DASFAA), pp. 53–60. World Scientific Press, Singapore (1995)

    Google Scholar 

  11. Heinlein, C.: Workflow and process synchronization with interaction expressions and graphs. In: Proceedings of the 17th International Conference on Data Engineering, Washington, DC, USA, pp. 243–252. IEEE Computer Society, Los Alamitos (2001)

    Chapter  Google Scholar 

  12. Baeten, J.C.M.: A brief history of process algebra. Theor. Comput. Sci. 335, 131–146 (2005)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hidders, J., Sroka, J. (2008). Towards a Calculus for Collection-Oriented Scientific Workflows with Side Effects. In: Meersman, R., Tari, Z. (eds) On the Move to Meaningful Internet Systems: OTM 2008. OTM 2008. Lecture Notes in Computer Science, vol 5331. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88871-0_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88871-0_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88870-3

  • Online ISBN: 978-3-540-88871-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics