On the expressive power of process interruption and compensation

Mathematical Structures in Computer Science

Volumn 19, Issue 3, 2009, Pages 565-599

  Bravetti, Mario ^a   Zavattaro, Gianluigi ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EXCEPTION HANDLING; EXPRESSIVE POWER; FOUNDATIONAL ASPECTS; IN-PROCESS; INTERRUPT OPERATOR; LINGUISTIC MECHANISM; LONG-RUNNING TRANSACTIONS; RECURSIONS; TERMINATION PROBLEMS; UNDECIDABILITY; WS-BPEL;

COMMUNICATION CHANNELS (INFORMATION THEORY);

COMPUTABILITY AND DECIDABILITY;

EID: 69749127224     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129509007683     Document Type: Article

References (29)

1. Baeten, J. C. M., Basten, T. and Reniers, M. A. (2008) Process algebra (equational theories of communicating processes), Cambridge Tracts in Theoretical Computer Science, Cambridge University Press.
2. Baeten, J. C. M. and Bergstra, J. A. (2000) Mode transfer in process algebra. Report CSR 00-01, Technische Universiteit Eindhoven. (This paper is an expanded and revised version of: Bergstra, J. (2000) A mode transfer operator in process algebra, Report P8808, Programming Research Group, University of Amsterdam, which is available at http://alexandria.tue.nl/extra1/wskrap/ publichtml/200010731.pdf.
3. Bocchi, L., Laneve, C. and Zavattaro, G. (2003) A calculus for long running transactions. In: FMOODS'03: Proceedings of the 6th IFIP Open Object-based Distributed Systems. Springer-Verlag Lecture Notes in Computer Science 2884 124-138.
4. Boreale, M., Bruni, R., Caires, L., De Nicola, R., Lanese, I., Loreti, M., Martins, F., Montanari, U., Ravara, A., Sangiorgi, D., Vasconcelos, V. T. and Zavattaro, G. (2006) SCC: A Service Centered Calculus. In: WS-FM 2006: Proceedings of the Third International Workshop on Web Services and Formal Methods. Springer-Verlag Lecture Notes in Computer Science 4184 38-57.
5. Bruni, R., Melgratti, H. C. and Montanari, U. (2004) Nested Commits for Mobile Calculi: Extending Join. In: TCS 2004: IFIP 18th World Computer Congress, TC1 3rd International Conference on Theoretical Computer Science, Kluwer 563-576.
6. Bruni, R., Melgratti, H. C. and Montanari, U. (2005) Theoretical foundations for compensations in flow composition languages. In: POPL 2005: Proceedings of the 32nd Symposium on Principles of Programming Languages, ACM Press 209-220.
7. Busi, N., Gabbrielli, M. and Zavattaro, G. (2003) Replication vs. Recursive Definitions in Channel Based Calculi. In: ICALP'03: Proceedings Languages and Programming. Springer-Verlag Lecture Notes in Computer Science 2719 133-144.
8. Busi, N., Gabbrielli, M. and Zavattaro, G. (2009) On the Expressive Power of Recursion, Replication and Iteration in Process Calculi. Mathematical Structures in Computer Science (to appear). (This is an extended version of Busi et al. (2003).
9. Butler, M. and Ferreira, C. (2004) An operational semantics for StAC, a language for modelling long-running business transactions. In: COORDINATION'04: Conference on Coordination Models and Languages. Springer-Verlag Lecture Notes in Computer Science 2949 87-104.
10. Butler, M., Hoare, C. A. R. and Ferreira, C. (2003) A trace semantics for long-running transactions. Springer-Verlag Lecture Notes in Computer Science 3525 133-150.
11. Esparza, J. and Nielsen, M. (1994) Decidability Issues for Petri Nets-a Survey. Bulletin of the European Association for TCS 52 245-262.
12. Finkel, A. and Schnoebelen, P. (2001) Well-Structured Transition Systems Everywhere! Theoretical Computer Science 256 63-92.
13. Goltz, U. (1988) On Representing CCS Programs by Finite Petri Nets. In: of Mathematical Foundations of Computer Science. Springer-Verlag Lecture Notes in Computer Science 324 339-350.
14. Guidi, C., Lanese, I., Montesi, F. and Zavattaro, G. (2008) On the Interplay between Fault Handling and Request-Response Service Invocations. In: ACSD'08: Conference on Application of Concurrency to System Design, IEEE Computer Society press 190-199.
15. Higman, G. (1952) Ordering by divisibility in abstract algebras. Proc. London Math. Soc. 2 236-366.
16. Hoare, C. A. R. (1985) Communicating Sequential Processes, Prentice-Hall.
17. Kruskal, J. B. (1960) Well-Quasi-Ordering, The Tree Theorem, and Transactions of the American Mathematical Society 95 (2) 210-225.
18. Laneve, C. and Zavattaro, G. (2005) Foundations of web transactions. In: FOSSACS 2005: Proceedings of the 8th International Conference on Foundations of Software Science and Computational Structures. Springer-Verlag Lecture Notes in Computer Science 3441 282-298.
19. Lapadula, A., Pugliese, R. and Tiezzi, F. (2007) A Calculus for Orchestration of Web Services. In: ESOP 2007: Proceedings of 16th European Symposium on Programming. Springer Verlag Lecture Notes in Computer Science 4421 33-47.
20. Milner, R. (1989) Communication and Concurrency, Prentice-Hall.
21. Milner, R., Parrow, J. and Walker, D. (1992) A Calculus of Mobile Processes, Part I + II. Information and Computation 100 (1) 1-77.
22. Minsky, M. L. (1967) Computation: finite and infinite machines , Prentice-Hall.
23. Misra, J. and Cook, W. R. (2007) Computation Orchestration. Journal of Software and System Modeling 6 (1) 83-110.
24. OASIS (2003 )WS-BPEL: Web Services Business Process Execution Language Version 2.0. Technical report, OASIS, 2003.
25. Palamidessi, C. (2003) Comparing the expressive power of the synchronous and asynchronous pi-calculus. Mathematical Structures in Computer Science 13 (5) 685-719. (A short version of this paper appeared in POPL'97.
26. Shepherdson, J. C. and Sturgis, J. E. (1963) Computability of recursive functions. Journal of the ACM 10 217-255.
27. Simpson, S. G. (1985) Nonprovability of certain combinatorial properties of finite trees. In: Harvey Friedman's , North-Holland 87-117.
28. Vieira, H. T., Caires, L. and Seco, J. C. (2008) The Conversation Calculus: A Model of Service-Oriented Computation. In: ESOP 2008: Proceedings of 17th European Symposium on Programming. Springer-Verlag Lecture Notes in Computer Science 4960 269-283.
29. W3C (2004) WS-CDL: web services choreography description language Technical report, W3C.