2004
DOI: 10.1007/978-3-540-30077-9_8
|View full text |Cite
|
Sign up to set email alerts
|

Formal Verification of BPEL4WS Business Collaborations

Abstract: Abstract. Web services are a very appropriate communication mechanism to perform distributed business processes among several organisations. These processes should be reliable, because a failure in them can cause high economic losses. To increase their reliability at design time, we have developed VERBUS, a framework for the formal verification of business processes. VERBUS can automatically translate business process definitions to specifications verifiable in several available tools. It is based on a modular… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
32
0
1

Year Published

2005
2005
2015
2015

Publication Types

Select...
5
3
2

Relationship

0
10

Authors

Journals

citations
Cited by 58 publications
(33 citation statements)
references
References 6 publications
0
32
0
1
Order By: Relevance
“…Some advocate the use of finite state machines [18,19], others process algebras [16,26], and yet others abstract state machines [14,15] or Petri nets [33,30,38,40]. For a detailed analysis of BPEL based on the workflow patterns [7] we refer to [45].…”
Section: Related Workmentioning
confidence: 99%
“…Some advocate the use of finite state machines [18,19], others process algebras [16,26], and yet others abstract state machines [14,15] or Petri nets [33,30,38,40]. For a detailed analysis of BPEL based on the workflow patterns [7] we refer to [45].…”
Section: Related Workmentioning
confidence: 99%
“…To the best of our knowledge only the consistency set approach has been implemented and applied to realistic examples. Note that there were other attempts at verifying business transactions [Pistore et al 2004;Koshkina and van Breugel 2004;Arias-Fisteus et al 2004;Kazhamiakin and Pistore 2005] mainly by translating the transactions to existing formalisms which support verification. However, none of these works fully supports the verification of transactions having compensations.…”
Section: Resultsmentioning
confidence: 99%
“…Some have defined translations from BPEL to finite state machines [Fisteus et al 2004], others to process algebra [Ferrara 2004], abstract state machines [Fahland and Reisig 2005] or Petri nets [Ouyang et al 2005a;Ouyang et al 2005b;Hinz et al 2005]. This paper uses the translation to Petri nets presented in [Ouyang et al 2005b] which is very detailed in terms of its coverage of control-flow constructs.…”
Section: Related Workmentioning
confidence: 99%