Fault, Compensation and Termination in WS-BPEL 2.0 — A Comparative Analysis
Identifieur interne : 000572 ( Main/Exploration ); précédent : 000571; suivant : 000573Fault, Compensation and Termination in WS-BPEL 2.0 — A Comparative Analysis
Auteurs : Christian Eisentraut [Allemagne] ; David Spieler [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2009.
English descriptors
- Teeft :
- Additional termination phase, Atomic activity, Basic building blocks, Bpel, Bpel process, Business processes, Calculus, Ccsp, Closure, Compensation, Compensation context, Compensation contexts, Compensation handler, Compensation handlers, Compensation handling, Compensation phase, Compensation phases, Compensation policy, Composite terms, Condition links, Correlation sets, Database systems, Default, Default compensation, Default compensation order, Default compensations, Eisentraut, Exception handling, Exit activity, Fault, Fault handler, Formal comparison, Formal semantics, Formal theories, Full extent, Generalized semantics, Handler, Heidelberg, Inference rules, Inner activity, Interruption policy, Lncs, Main activity, Main transaction, Nameless fault, Natural choice, Nice comparison, Nondeterministic choice, Normal mode, Notes theor, Operational semantics, Parallel branches, Parallel composition, Parallel execution, Parallel operator, Parallel terms, Partial order, Partial order trace, Partial orders, Possible behaviors, Process level, Process term, Programmable compensations, Respective activities, Rule process, Saga, Sagas behavior, Sagas term, Sagas terms, Same level, Same time, Scope fault, Scopes, Semantics, Sequential processes, Spieler, Springer, Subset, Successful compensation, Successful completion, Successful termination, Term structure, Termination, Termination handler, Termination handling, Theoretical foundations, Translation function, York university.
Abstract
Abstract: One of the most challenging aspects in Web Service composition is guaranteeing transactional integrity. This is usually achieved by providing mechanisms for fault, compensation and termination (FCT) handling. WS-BPEL 2.0, the de-facto standard language for Business Process Orchestration provides powerful scope-based FCT-handling mechanisms. However, the lack of a formal semantics makes it difficult to understand and implement these constructs, and renders rigid analysis impossible. The general concept of compensating long-running business transactions has been studied in different formal theories, such as cCSP and Sagas, but none of them is specific to WS-BPEL 2.0. Other approaches aim at providing formal semantics for FCT-handling in WS-BPEL 2.0, but only concentrate on specific aspects. Therefore, they cannot be used for a comparative analysis of FCT-handling in WS-BPEL 2.0. In this paper we discuss the BPEL approach to FCT-handling in the light of recent research. We provide formal semantics for the WS-BPEL 2.0 FCT-handling mechanisms which aims at capturing the FCT-part of the WS-BPEL 2.0 specification in full detail. We then compare the WS-BPEL 2.0 approach to FCT-handling to existing formal theories.
Url:
DOI: 10.1007/978-3-642-01364-5_7
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000599
- to stream Istex, to step Curation: 000567
- to stream Istex, to step Checkpoint: 000409
- to stream Main, to step Merge: 000572
- to stream Main, to step Curation: 000572
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Fault, Compensation and Termination in WS-BPEL 2.0 — A Comparative Analysis</title><author><name sortKey="Eisentraut, Christian" sort="Eisentraut, Christian" uniqKey="Eisentraut C" first="Christian" last="Eisentraut">Christian Eisentraut</name></author><author><name sortKey="Spieler, David" sort="Spieler, David" uniqKey="Spieler D" first="David" last="Spieler">David Spieler</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:39C0DF4FBA4987341D2F7EFAA75C6ABF2EBCA07F</idno><date when="2009" year="2009">2009</date><idno type="doi">10.1007/978-3-642-01364-5_7</idno><idno type="url">https://api.istex.fr/document/39C0DF4FBA4987341D2F7EFAA75C6ABF2EBCA07F/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000599</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000599</idno><idno type="wicri:Area/Istex/Curation">000567</idno><idno type="wicri:Area/Istex/Checkpoint">000409</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000409</idno><idno type="wicri:doubleKey">0302-9743:2009:Eisentraut C:fault:compensation:and</idno><idno type="wicri:Area/Main/Merge">000572</idno><idno type="wicri:Area/Main/Curation">000572</idno><idno type="wicri:Area/Main/Exploration">000572</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Fault, Compensation and Termination in WS-BPEL 2.0 — A Comparative Analysis</title><author><name sortKey="Eisentraut, Christian" sort="Eisentraut, Christian" uniqKey="Eisentraut C" first="Christian" last="Eisentraut">Christian Eisentraut</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Department of Computer Science, Saarland University, Campus Saarbrücken, 66123, Saarbrücken</wicri:regionArea><placeName><region type="land" nuts="2">Sarre (Land)</region><settlement type="city">Sarrebruck</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Spieler, David" sort="Spieler, David" uniqKey="Spieler D" first="David" last="Spieler">David Spieler</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Department of Computer Science, Saarland University, Campus Saarbrücken, 66123, Saarbrücken</wicri:regionArea><placeName><region type="land" nuts="2">Sarre (Land)</region><settlement type="city">Sarrebruck</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2009</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="Teeft" xml:lang="en"><term>Additional termination phase</term><term>Atomic activity</term><term>Basic building blocks</term><term>Bpel</term><term>Bpel process</term><term>Business processes</term><term>Calculus</term><term>Ccsp</term><term>Closure</term><term>Compensation</term><term>Compensation context</term><term>Compensation contexts</term><term>Compensation handler</term><term>Compensation handlers</term><term>Compensation handling</term><term>Compensation phase</term><term>Compensation phases</term><term>Compensation policy</term><term>Composite terms</term><term>Condition links</term><term>Correlation sets</term><term>Database systems</term><term>Default</term><term>Default compensation</term><term>Default compensation order</term><term>Default compensations</term><term>Eisentraut</term><term>Exception handling</term><term>Exit activity</term><term>Fault</term><term>Fault handler</term><term>Formal comparison</term><term>Formal semantics</term><term>Formal theories</term><term>Full extent</term><term>Generalized semantics</term><term>Handler</term><term>Heidelberg</term><term>Inference rules</term><term>Inner activity</term><term>Interruption policy</term><term>Lncs</term><term>Main activity</term><term>Main transaction</term><term>Nameless fault</term><term>Natural choice</term><term>Nice comparison</term><term>Nondeterministic choice</term><term>Normal mode</term><term>Notes theor</term><term>Operational semantics</term><term>Parallel branches</term><term>Parallel composition</term><term>Parallel execution</term><term>Parallel operator</term><term>Parallel terms</term><term>Partial order</term><term>Partial order trace</term><term>Partial orders</term><term>Possible behaviors</term><term>Process level</term><term>Process term</term><term>Programmable compensations</term><term>Respective activities</term><term>Rule process</term><term>Saga</term><term>Sagas behavior</term><term>Sagas term</term><term>Sagas terms</term><term>Same level</term><term>Same time</term><term>Scope fault</term><term>Scopes</term><term>Semantics</term><term>Sequential processes</term><term>Spieler</term><term>Springer</term><term>Subset</term><term>Successful compensation</term><term>Successful completion</term><term>Successful termination</term><term>Term structure</term><term>Termination</term><term>Termination handler</term><term>Termination handling</term><term>Theoretical foundations</term><term>Translation function</term><term>York university</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: One of the most challenging aspects in Web Service composition is guaranteeing transactional integrity. This is usually achieved by providing mechanisms for fault, compensation and termination (FCT) handling. WS-BPEL 2.0, the de-facto standard language for Business Process Orchestration provides powerful scope-based FCT-handling mechanisms. However, the lack of a formal semantics makes it difficult to understand and implement these constructs, and renders rigid analysis impossible. The general concept of compensating long-running business transactions has been studied in different formal theories, such as cCSP and Sagas, but none of them is specific to WS-BPEL 2.0. Other approaches aim at providing formal semantics for FCT-handling in WS-BPEL 2.0, but only concentrate on specific aspects. Therefore, they cannot be used for a comparative analysis of FCT-handling in WS-BPEL 2.0. In this paper we discuss the BPEL approach to FCT-handling in the light of recent research. We provide formal semantics for the WS-BPEL 2.0 FCT-handling mechanisms which aims at capturing the FCT-part of the WS-BPEL 2.0 specification in full detail. We then compare the WS-BPEL 2.0 approach to FCT-handling to existing formal theories.</div></front></TEI><affiliations><list><country><li>Allemagne</li></country><region><li>Sarre (Land)</li></region><settlement><li>Sarrebruck</li></settlement></list><tree><country name="Allemagne"><region name="Sarre (Land)"><name sortKey="Eisentraut, Christian" sort="Eisentraut, Christian" uniqKey="Eisentraut C" first="Christian" last="Eisentraut">Christian Eisentraut</name></region><name sortKey="Eisentraut, Christian" sort="Eisentraut, Christian" uniqKey="Eisentraut C" first="Christian" last="Eisentraut">Christian Eisentraut</name><name sortKey="Spieler, David" sort="Spieler, David" uniqKey="Spieler D" first="David" last="Spieler">David Spieler</name><name sortKey="Spieler, David" sort="Spieler, David" uniqKey="Spieler D" first="David" last="Spieler">David Spieler</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Sarre/explor/MusicSarreV3/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000572 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000572 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Sarre
|area= MusicSarreV3
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:39C0DF4FBA4987341D2F7EFAA75C6ABF2EBCA07F
|texte= Fault, Compensation and Termination in WS-BPEL 2.0 — A Comparative Analysis
}}
| This area was generated with Dilib version V0.6.33. |  |