General decidability theorems for infinite-state systems, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, pp.313-321, 1996. ,
DOI : 10.1109/LICS.1996.561359
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.2627
A Calculus for Long-Running Transactions, Proc. of FMOODS'03, pp.124-138, 2003. ,
DOI : 10.1016/0890-5401(92)90008-4
A Java Inspired Semantics for Transactions in SOC, Proc. of TGC 2010, pp.120-134, 2010. ,
DOI : 10.1007/978-3-642-15640-3_9
Adaptable processes, Logical Methods in Computer Science, vol.8, issue.4, p.2012 ,
DOI : 10.2168/LMCS-8(4:13)2012
URL : https://hal.archives-ouvertes.fr/hal-00909365
On the expressive power of process interruption and compensation, Mathematical Structures in Computer Science, vol.4960, issue.03, pp.565-599, 2009. ,
DOI : 10.1007/s10270-006-0012-1
Comparing Two Approaches to Compensable Flow Composition, Proc . of CONCUR'05, pp.383-397, 2005. ,
DOI : 10.1007/11539452_30
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.7429
A New Strategy for Distributed Compensations with Interruption in Long-Running Transactions, Proc. of WADT 2010, pp.42-60, 2010. ,
DOI : 10.1007/978-3-540-78739-6_21
Nested Commits For Mobile Calculi: Extending Join, Proc. of IFIP TCS'04, pp.563-576, 2004. ,
DOI : 10.1007/1-4020-8141-3_43
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.120.6285
Theoretical foundations for compensations in flow composition languages, Proc. of POPL '05, pp.209-220, 2005. ,
A Trace Semantics for Long-Running Transactions, 25 Years CSP, pp.133-150, 2004. ,
DOI : 10.1007/11423348_8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.100.3195
A Process Calculus Analysis of Compensations, Proc. of TGC'08, pp.87-103, 2008. ,
DOI : 10.1007/978-3-540-78739-6_21
Communicating Transactions, Proc. of CONCUR 2010, pp.569-583, 2010. ,
DOI : 10.1007/978-3-642-15375-4_39
On the Expressiveness of Forwarding in Higher-Order Communication, Proc. of ICTAC'09, pp.155-169, 2009. ,
DOI : 10.1007/978-3-642-03466-4_10
Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors, American Journal of Mathematics, vol.35, issue.4, pp.413-422, 1913. ,
DOI : 10.2307/2370405
Well-structured transition systems everywhere! Theoretical Computer Science, pp.63-92, 2001. ,
DOI : 10.1016/s0304-3975(00)00102-x
URL : http://doi.org/10.1016/s0304-3975(00)00102-x
Dynamic error handling in service oriented applications, Fundamenta Informaticae, vol.95, issue.1, pp.73-102, 2009. ,
Ordering by Divisibility in Abstract Algebras, Proc. London Math. Soc., 3rd series, pp.326-336, 1952. ,
DOI : 10.1112/plms/s3-2.1.326
URL : http://plms.oxfordjournals.org/cgi/content/short/s3-2/1/326
Static vs Dynamic SAGAs, Proc. of ICE 2010, pp.51-65, 2010. ,
DOI : 10.4204/EPTCS.38.7
URL : http://doi.org/10.4204/eptcs.38.7
On the expressiveness and decidability of higher-order process calculi, Proc. of LICS'08, pp.145-155, 2008. ,
URL : https://hal.archives-ouvertes.fr/hal-01112294
On the Expressive Power of Primitives for Compensation Handling, Proc. of ESOP 2010, pp.366-386, 2010. ,
DOI : 10.1007/978-3-642-11957-6_20
Programming Sagas in SOCK, 2009 Seventh IEEE International Conference on Software Engineering and Formal Methods, pp.189-198, 2009. ,
DOI : 10.1109/SEFM.2009.23
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.408.2955
Foundations of Web Transactions, Proc. of FoS- SaCS'05, pp.282-298, 2005. ,
DOI : 10.1007/978-3-540-31982-5_18
A calculus of mobile processes, II, Information and Computation, vol.100, issue.1, pp.1-4041, 1992. ,
DOI : 10.1016/0890-5401(92)90009-5
Computation: finite and infinite machines, 1967. ,
Composing Services with JOLIE, Fifth European Conference on Web Services (ECOWS'07), pp.13-22, 2007. ,
DOI : 10.1109/ECOWS.2007.19
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.408.2241
Web Services Business Process Execution Language Version 2.0, 2007. ,
Dynamic Recovering of Long Running Transactions, Proc. of TGC'08, pp.201-215, 2008. ,
DOI : 10.1007/11948148_27