A Formula Driven Incremental Construction of Web Service Compositions

We present a modular approach to system specification to support the realization of web services. In particular, we solve the following problem: given the formal specification of the (incomplete) system, say p already built, what is a characterization of the sub-systems that can collaborate with p, through a given communication interfaceL , so that the complete system satisfies a given property φ? An automatic procedure is defined to identify the formulaψ such that, for each process q satisfyingψ, the parallel composition of p andq through L satisfiesφ. For applicability of the method to web service compositions the formula ψ should specify, as much as possible, only the communication actions that allow p to correctly fulfill φ.

[1]  Paola Inverardi,et al.  Static checking of system behaviors using derived component assumptions , 2000, TSEM.

[2]  Carlo A. Furia,et al.  A Compositional World , 2005 .

[3]  Paolo Traverso,et al.  SeCSE—Service-centric System Engineering: An Overview , 2009 .

[4]  Rance Cleaveland,et al.  Tableau-based model checking in the propositional mu-calculus , 1990, Acta Informatica.

[5]  Niels Lohmann,et al.  Behavioral Constraints for Services , 2007, BPM.

[6]  Howard Barringer,et al.  Assumption generation for software component verification , 2002, Proceedings 17th IEEE International Conference on Automated Software Engineering,.

[7]  Rance Cleaveland,et al.  The NCSU Concurrency Workbench , 1996, CAV.

[8]  Colin Stirling,et al.  An Introduction to Modal and Temporal Logics for CCS , 1991, Concurrency: Theory, Language, And Architecture.

[9]  Fabio Martinelli,et al.  Synthesis of Web Services Orchestrators in a Timed Setting , 2007, WS-FM.

[10]  Michael Huth,et al.  Assume-Guarantee Model Checking of Software: A Comparative Case Study , 1999, SPIN.

[11]  Xiang Fu,et al.  Synchronizability of conversations among Web services , 2005, IEEE Transactions on Software Engineering.

[12]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[13]  Raman Kazhamiakin,et al.  Analysis of communication models in web service compositions , 2006, WWW '06.

[14]  Li Bao,et al.  Describing and Verifying Web Service Using CCS , 2006, 2006 Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT'06).

[15]  Henrik Reif Andersen,et al.  Partial Model Checking (Extended Abstract) , 1995, LICS 1995.

[16]  Dana Angluin,et al.  Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..

[17]  Roberto Barbuti,et al.  Selective Mu-Calculus and Formula-Based Equivalence of Transition Systems , 1999, J. Comput. Syst. Sci..

[18]  Piergiorgio Bertoli,et al.  Integrating Discovery and Automated Composition: from Semantic Requirements to Executable Code , 2007, IEEE International Conference on Web Services (ICWS 2007).