Validation and verification of Web services choreographies by using timed automata

Cambronero, M. Emilia; D́ıaz, Gregorio; Valero, Valentín; Martínez, Enrique

doi:10.1016/j.jlap.2010.02.001

Cited by 40 publications

(19 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A large number of research work has been developed for synthesis of composite services to address service composition issue by using formal methods such as process algebras (see, e.g, [3], [4]), automata (see, e.g, [5], [6]) or Petri Net (see, e.g, [7], [8]). For example, in [3], the authors present a BP-calculus, a π-like calculus and define specific equivalence relations.…”

Section: Related Workmentioning

confidence: 99%

A Correctness Assurance Approach to Automatic Synthesis of Composite Web Services

Fan

Huang

Tang

2014

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYOne of the most important problems in web services application is the integration of different existing services into a new composite service. Existing work has the following disadvantages: (i) developers are often required to provide a composite service model first and perform formal verifications to check whether the model is correct. This makes the synthesis process of composite services semi-automatic, complex and inefficient; (ii) there is no assurance that composite services synthesized by using the fully-automatic approaches are correct; (iii) some approaches only handle simple composition problems where existing services are atomic.To address these problems, we propose a correct assurance approach for automatically synthesizing composite services based on finite state machine model. The syntax and semantics of the requirement model specifying composition requirements is also proposed. Given a set of abstract BPEL descriptions of existing services, and a composition requirement, our approach automatically generate the BPEL implementation of the composite service. Compared with existing approaches, the composite service generated by utilizing our proposed approach is guaranteed to be correct and does not require any formal verification. The correctness of our approach is proved. Moreover, the case analysis indicates that our approach is feasible and effective.

show abstract

Section: Related Workmentioning

confidence: 99%

A Correctness Assurance Approach to Automatic Synthesis of Composite Web Services

Fan

Huang

Tang

2014

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

show abstract

“…Finally, WS-CDL is a more recent description language which aims at describing decentralised choreographies. Cambronero et al [11] transform choreographies written in WS-CDL into timed-automata and verify systems against them. The work in [11] does not develop a projection algorithm nor ensures global conformance with respect to a choreography.…”

Section: Related Workmentioning

confidence: 99%

Monitoring Networks through Multiparty Session Types

Bocchi

Chen

Demangeon

et al. 2013

Formal Techniques for Distributed Systems

View full text Add to dashboard Cite

In large-scale distributed infrastructures, applications are realised through communications among distributed components. The need for methods for assuring safe interactions in such environments is recognised, however the existing frameworks, relying on centralised verification or restricted specification methods, have limited applicability. This paper proposes a new theory of monitored π -calculus with dynamic usage of multiparty session types (MPST), offering a rigorous foundation for safety assurance of distributed components which asynchronously communicate through multiparty sessions. Our theory establishes a framework for semantically precise decentralised run-time enforcement and provides reasoning principles over monitored distributed applications, which complement existing static analysis techniques. We introduce asynchrony through the means of explicit routers and global queues, and propose novel equivalences between networks, that capture the notion of interface equivalence, i.e. equating networks offering the same services to a user. We illustrate our static-dynamic analysis system with an ATM protocol as a running example and justify our theory with results: satisfaction equivalence, local/global safety and transparency, and session fidelity.

show abstract

“…We focus on and study this topic in this paper. Web service composition workflow is often analyzed by formal methods including Petri nets [13], state automaton [14], description logic [15], process algebra [16] and so on. Process algebra is unintuitive for its excessive symbolic expression.…”

Section: Introductionmentioning

confidence: 99%