A calculus of mobile processes, II
Information and Computation
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On bisimulations of the asynchronous &pgr;-calculus
Theoretical Computer Science
Component Software: Beyond Object-Oriented Programming
Component Software: Beyond Object-Oriented Programming
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Communications of the ACM - Service-oriented computing
Service-Oriented Computing: Key Concepts and Principles
IEEE Internet Computing
Foundations of web transactions
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
A trace semantics for long-running transactions
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
Dynamic Recovering of Long Running Transactions
Trustworthy Global Computing
Proof Techniques for Adapter Generation
Web Services and Formal Methods
A calculus for orchestration of web services
ESOP'07 Proceedings of the 16th European conference on Programming
Soundness verification of business processes specified in the Pi-calculus
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part I
Formal analysis of BPMN via a translation into COWS
COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
A formal semantics for the WS-BPEL recovery framework: the π-calculus way
WS-FM'09 Proceedings of the 6th international conference on Web services and formal methods
Towards compensation correctness in interactive systems
WS-FM'09 Proceedings of the 6th international conference on Web services and formal methods
A java inspired semantics for transactions in SOC
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Advanced mechanisms for service combination and transactions
Rigorous software engineering for service-oriented systems
On the expressive power of primitives for compensation handling
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
Toward design, modelling and analysis of dynamic workflow reconfigurations
WS-FM'11 Proceedings of the 8th international conference on Web Services and Formal Methods
Failure-divergence semantics and refinement of long running transactions
Theoretical Computer Science
First-Order dynamic logic for compensable processes
COORDINATION'12 Proceedings of the 14th international conference on Coordination Models and Languages
Recovery within long-running transactions
ACM Computing Surveys (CSUR)
Towards a formal analysis of dynamic reconfiguration in WS-BPEL
Intelligent Decision Technologies
| Hi-index | 0.00 |
Recently the term orchestration has been introduced to address composition and coordination of web services. Several languages used to describe business processes using this approach have been presented, and most of them use the concepts of long-running transactions and compensations to cope with error handling. WS-BPEL, which is currently the most used orchestration language, also provides a Recovery Framework. However its complexity hinders rigorous treatment. In this paper, we address the notion of orchestration from a formal point of view with particular attention to transactions and compensations. In particular, we introduce webπ∞, an untimed version of webπ, and the related theory, as a foundational unifying framework for orchestration able to meet composition requirements and to encode the whole BPEL itself.