Abstract
Orc is a new language for task orchestration, a form of concurrent programming with applications in workflow, business process management, and web service orchestration. Orc provides constructs to orchestrate the concurrent invocation of services – while managing time-outs, priorities, and failure of services or communication. In this paper, we show a trace-based semantic model for Orc, which induces a congruence on Orc programs and facilitates reasoning about them. Despite the simplicity of the language and its semantic model, Orc is able to express a variety of useful orchestration tasks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aalst, W.M.P.V.D., Hofstede, A.H.M.T., Kiepuszewski, B., Barros, A.P.: Workflow patterns. Distrib. Parallel Databases 14(1), 5–51 (2003)
Misra, J., Cook, W.R.: Computation orchestration: A basis for wide-area computing. Journal of Software and Systems Modeling (May 2006), Available for download at: http://dx.doi.org/10.1007/s10270-006-0012-1
Cook, W.R., Patwardhan, S., Misra, J.: Workflow patterns in Orc. In: Ciancarini, P., Wiklicky, H. (eds.) COORDINATION 2006. LNCS, vol. 4038, pp. 82–96. Springer, Heidelberg (2006)
Rosario, S., Benveniste, A., Haar, S., Jard, C.: SLA for web services orchestrations (unpublished, manuscript 2006)
Kozen, D.: On Kleene algebras and closed semirings. In: Rovan, B. (ed.) MFCS 1990. LNCS, vol. 452, pp. 26–47. Springer, Heidelberg (1990)
Milner, R.: Communication and Concurrency. International Series in Computer Science (C.A.R. Hoare, series editor). Prentice-Hall, Englewood Cliffs (1989)
Kitchin, D., Cook, W.R., Misra, J.: Semantic properties of asynchronous Orc. Technical Report TR-06-32, University of Texas at Austin, Department of Computer Sciences (2006)
Eshuis, R., Dehnert, J.: Reactive Petri Nets for Workflow Modeling. In: van der Aalst, W.M.P., Best, E. (eds.) ICATPN 2003. LNCS, vol. 2679, pp. 296–315. Springer, Heidelberg (2003)
Puhlmann, F., Weske, M.: Using the π-Calculus for Formalizing Workflow Patterns. In: van der Aalst, W.M.P., Benatallah, B., Casati, F., Curbera, F. (eds.) BPM 2005. LNCS, vol. 3649, pp. 153–168. Springer, Heidelberg (2005)
van Glabbeek, R.: On specifying timeouts. In: Workshop on Algebraic Process Calculi: The First Twenty Five Years and Beyond. Electronic Notes in Theoretical Computer Science (to appear, 2005)
van der Aalst, W.M.P., Aldred, L., Dumas, M., ter Hofstede, A.H.M.: Design and implementation of the YAWL system. In: Persson, A., Stirna, J. (eds.) CAiSE 2004. LNCS, vol. 3084, pp. 142–159. Springer, Heidelberg (2004)
Hoare, C.: Communicating Sequential Processes. Prentice Hall International, Englewood Cliffs (1984)
Milner, R.: Communicating and Mobile Systems: the π-Calculus. Cambridge University Press, Cambridge (1999)
Riely, J., Hennessy, M.: Distributed processes and location failures. Theoretical Computer Science 266(1–2), 693–735 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kitchin, D., Cook, W.R., Misra, J. (2006). A Language for Task Orchestration and Its Semantic Properties. In: Baier, C., Hermanns, H. (eds) CONCUR 2006 – Concurrency Theory. CONCUR 2006. Lecture Notes in Computer Science, vol 4137. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11817949_32
Download citation
DOI: https://doi.org/10.1007/11817949_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37376-6
Online ISBN: 978-3-540-37377-3
eBook Packages: Computer ScienceComputer Science (R0)