Algorithms and Complexity of Automata Synthesis by Asynhcronous Orchestration With Applications to Web Services Composition

Balbiani, Philippe; Cheikh, Fahima; Feuillade, Guillaume

doi:10.1016/j.entcs.2009.06.036

Cited by 5 publications

(2 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These notations are limited because branching and cyclic behaviors are not well supported by CDs and MSCs (e.g., no choice operator and repetition limited to a message at a time in CDs). [41] analyzes the computational complexity of the composition problem, which aims at generating a composition of services interacting via bounded buffers that satisfies a given goal. Our synthesis techniques are quite different because peers are obtained via projection from a choreography specification and controllers non-intrusively monitor those peers to make them respect the choreography ordering constraints.…”

Section: Related Workmentioning

confidence: 99%

VerChor: A Framework for the Design and Verification of Choreographies

Güdemann

Poizat

Salaün

et al. 2016

IEEE Trans. Serv. Comput.

View full text Add to dashboard Cite

Choreographies are contracts specifying from a global point of view the legal interactions that must take place among a set of services. Such a contract may serve as a reference in the development of concurrent distributed system, whether it is achieved following a top-down or a bottom-up approach. In this article, we present VerChor, a generic, modular, and extensible framework for supporting the development based on choreographies. It relies on a choreography intermediate format (CIF) into which several existing choreography description languages can be transformed. VerChor builds around a set of formal properties whose verification is central to choreography-based development. To support this development process, we propose a connection between CIF and the CADP verification toolbox, which enables the full automation of the aforementioned properties. Finally, we illustrate a practical use of the VerChor framework through its integration with the Eclipse BPMN 2.0 designer.

show abstract

Section: Related Workmentioning

confidence: 99%

VerChor: A Framework for the Design and Verification of Choreographies

Güdemann

Poizat

Salaün

et al. 2016

IEEE Trans. Serv. Comput.

View full text Add to dashboard Cite

show abstract

“…The client and the services exhibit infinite-state behavior: the transitions are labeled with guards over an infinite domain. In [2] the communication actions are performed through channels. Guards/conditions and constraints on the transitions have been introduced as well, e.g.…”

Section: Introductionmentioning

confidence: 99%

Fresh-Variable Automata: Application to Service Composition

Belkhir

Chevalier

Rusinowitch

2013

2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing

View full text Add to dashboard Cite

To model Web services handling data from an infinite domain, or with multiple sessions, we introduce fresh-variable automata, a simple extension of finite-state automata in which some transitions are labeled with variables that can be refreshed in some specified states. We prove several closure properties for this class of automata and study their decision problems. We then introduce a notion of simulation that enables us to reduce the Web service composition problem to the construction of a simulation of a target service by the asynchronous product of existing services, and prove that this construction is computable.

show abstract