Abstract
The investigation of the foundational aspects of linguistic mechanisms for programming long running transactions (such as the scope operator of WS-BPEL) has recently renewed the interest in process algebraic operators that interrupt the execution of one process, replacing it with another one called the compensation. We investigate the expressive power of two of such operators, the interrupt operator of CSP and the try-catch operator for exception handling. We consider two non Turing powerful fragments of CCS (without restriction and relabeling, but with either replication or recursion). We show that the addition of such operators strictly increases the expressive power of the calculi. The calculi with replication and either interrupt or try-catch turn out to be weakly Turing powerful (Turing Machines can be encoded but only nondeterministically). The calculus with recursion is weakly Turing powerful when extended with interrupt, but it is Turing complete (Turing Machine can be modeled deterministically) when extended with try-catch.
Research partially funded by EU Integrated Project Sensoria, contract n. 016004.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Baeten, J.C.M., Basten, T., Reniers, M.A.: Process algebra (equational theories of communicating processes. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge (2008)
Baeten, J.C.M., Bergstra, J.: Mode transfer in process algebra. Report CSR 00-01, Technische Universiteit Eindhoven. This paper is an expanded and revised version of J. Bergstra, A mode transfer operator in process algebra, Report P8808, Programming Research Group, University of Amsterdam (2000), http://alexandria.tue.nl/extra1/wskrap/publichtml/200010731.pdf
Bocchi, L., Laneve, C., Zavattaro, G.: A calculus for long running transactions. In: Najm, E., Nestmann, U., Stevens, P. (eds.) FMOODS 2003. LNCS, vol. 2884, pp. 124–138. Springer, Heidelberg (2003)
Boreale, M., Bruni, R., Caires, L., De Nicola, R., Lanese, I., Loreti, M., Martins, F., Montanari, U., Ravara, A., Sangiorgi, D., Vasconcelos, V.T., Zavattaro, G.: SCC: A Service Centered Calculus. In: Bravetti, M., Núñez, M., Zavattaro, G. (eds.) WS-FM 2006. LNCS, vol. 4184, pp. 38–57. Springer, Heidelberg (2006)
Bravetti, M., Zavattaro, G.: On the Expressive Power of Process Interruption and Compensation. Technical report, http://cs.unibo.it/~zavattar/papers.html
Bruni, R., Melgratti, H.C., Montanari, U.: Nested Commits for Mobile Calculi: Extending Join. In: TCS 2004: IFIP 18th World Computer Congress, TC1 3rd International Conference on Theoretical Computer Science, pp. 563–576. Kluwer, Dordrecht (2004)
Bruni, R., Melgratti, H.C., Montanari, U.: Theoretical foundations for compensations in flow composition languages. In: POPL 2005: Proceedings of the 32nd Symposium on Principles of Programming Languages, pp. 209–220. ACM Press, New York (2005)
Busi, N., Gabbrielli, M., Zavattaro, G.: Replication vs. Recursive Definitions in Channel Based Calculi. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 133–144. Springer, Heidelberg (2003)
Busi, N., Gabbrielli, M., Zavattaro, G.: On the Expressive Power of Recursion, Replication, and Iteration in Process Calculi. Technical report, http://cs.unibo.it/~zavattar/papers.html Extended version of BGZ03
Butler, M., Ferreira, C.: An operational semantics for StAC, a language for modelling long-running business transactions. In: De Nicola, R., Ferrari, G.-L., Meredith, G. (eds.) COORDINATION 2004. LNCS, vol. 2949, pp. 87–104. Springer, Heidelberg (2004)
Butler, M., Hoare, T., Ferreira, C.: A trace semantics for long-running transactions. In: Abdallah, A.E., Jones, C.B., Sanders, J.W. (eds.) Communicating Sequential Processes. LNCS, vol. 3525, pp. 133–150. Springer, Heidelberg (2005)
Finkel, A., Schnoebelen, P.: Well-Structured Transition Systems Everywhere! Theoretical Computer Science 256, 63–92 (2001)
Higman, G.: Ordering by divisibility in abstract algebras. Proc. London Math. Soc. 2, 236–366 (1952)
Hoare, T.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)
Kruskal, J.B.: Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi’s Conjecture. Transactions of the American Mathematical Society 95(2), 210–225 (1960)
Laneve, C., Zavattaro, G.: Foundations of web transactions. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol. 3441, pp. 282–298. Springer, Heidelberg (2005)
Lapadula, A., Pugliese, R., Tiezzi, F.: A Calculus for Orchestration of Web Services. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421, pp. 33–47. Springer, Heidelberg (2007)
Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)
Milner, R., Parrow, J., Walker, D.: A Calculus of Mobile Processes, Part I + II. Information and Computation 100(1), 1–77 (1992)
Minsky, M.L.: Computation: finite and infinite machines. Prentice-Hall, Englewood Cliffs (1967)
Misra, J., Cook, W.R.: Computation Orchestration. Journal of Software and System Modeling 6(1), 83–110 (2007)
OASIS. WS-BPEL: Web Services Business Process Execution Language Version 2.0. Technical report, OASIS (2003)
Palamidessi, C.: Comparing the Expressive Power of the Synchronous and the Asynchronous pi-calculus. In: Mathematical Structures in Computer Science, vol. 13(5), pp. 685–719. Cambridge University Press, Cambridge (2003); A short version of this paper appeared in POPL 1997 (1997)
Shepherdson, J.C., Sturgis, J.E.: Computability of recursive functions. Journal of the ACM 10, 217–255 (1963)
Simpson, S.G.: Nonprovability of certain combinatorial properties of finite trees. In: Harvey Friedman’s Research on the Foundations of Mathematics, pp. 87–117. North-Holland, Amsterdam (1985)
Vieira, H.T., Caires, L., Seco, J.C.: The Conversation Calculus: A Model of Service-Oriented Computation. In: Drossopoulou, S. (ed.) ESOP 2008. LNCS, vol. 4960, pp. 269–283. Springer, Heidelberg (2008)
W3C. WS-CDL: Web Services Choreography Description Language. Technical report, W3C (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bravetti, M., Zavattaro, G. (2009). On the Expressive Power of Process Interruption and Compensation. In: Bruni, R., Wolf, K. (eds) Web Services and Formal Methods. WS-FM 2008. Lecture Notes in Computer Science, vol 5387. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01364-5_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-01364-5_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01363-8
Online ISBN: 978-3-642-01364-5
eBook Packages: Computer ScienceComputer Science (R0)