Synthesis of Web Services Orchestrators in a Timed Setting

In this paper we present a framework based on partial model checking technique, process algebra and logic for the synthesis of Web Services orchestrators in a timed setting. We suppose to have a network of services and a user's request, expressed as a temporal logic formula by which also time constraints are specified. We define a process algebra operator, called orchestrating operator that permits us to manage services in order to satisfy the user's request. In order to isolate the behavior that the orchestrator should have to manage the given services, we extend the definition of the partial model checking function to the orchestrating operator. By using this function we are able to reduce the starting problem to a satisfiability one that we solve by exploiting a satisfiability procedure for temporal logic. In this way we automatically generate an orchestrator process as a model of the request.

[1]  Marco Pistore,et al.  Process-Level Composition of Executable Web Services: "On-the-fly" Versus "Once-for-all" Composition , 2005, ESWC.

[2]  Jun Sun,et al.  Verification of Computation Orchestration Via Timed Automata , 2006, ICFEM.

[3]  Fabio Casati,et al.  Compatibility and replaceability analysis for timed web service protocols , 2005, BDA.

[4]  Henrik Reif Andersen,et al.  Partial model checking , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[5]  Fabio Casati,et al.  Service-Oriented Computing - ICSOC 2005, Third International Conference, Amsterdam, The Netherlands, December 12-15, 2005, Proceedings , 2005, ICSOC.

[6]  Ilaria Matteucci,et al.  A Tool for the Synthesis of Controller Programs , 2006, Formal Aspects in Security and Trust.

[7]  Igor Walukiewicz,et al.  A Complete Deductive System for the mu-Calculus , 1995 .

[8]  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).

[9]  Gian Luigi Ferrari,et al.  Security Issues in Service Composition , 2006, FMOODS.

[10]  Ajitha Rajan,et al.  Requirements Coverage as an Adequacy Measure for Conformance Testing , 2008, ICFEM.

[11]  Enrico Tronci,et al.  Automated analysis of timed security: a case study on web privacy , 2004, International Journal of Information Security.

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

[13]  Fabio Martinelli,et al.  Through Modeling to Synthesis of Security Automata , 2007, STM.

[14]  Roberto Gorrieri,et al.  Information flow analysis in a discrete-time process algebra , 2000, Proceedings 13th IEEE Computer Security Foundations Workshop. CSFW-13.

[15]  Gwen Salaün,et al.  Describing and reasoning on Web services using process algebra , 2004 .

[16]  Roberto Gorrieri,et al.  A simple framework for real-time cryptographic protocol analysis with compositional proof rules , 2004, Sci. Comput. Program..

[17]  Ilaria Matteucci,et al.  Automated Synthesis of Enforcing Mechanisms for Security Properties in a Timed Setting , 2007, ICS@SYNASC.

[18]  H. Andersen.  Verification of Temporal Properties of Concurrent Systems , 1993 .

[19]  Brian Campbell,et al.  Amortised Memory Analysis Using the Depth of Data Structures , 2009, ESOP.

[20]  Francesco Tiezzi,et al.  A Calculus for Orchestration of Web Services , 2007, ESOP.

[21]  Paola Inverardi,et al.  On the Relationships among four Timed Process Algebras , 1999, Fundam. Informaticae.

[22]  E. Allen Emerson,et al.  An Automata Theoretic Decision Procedure for the Propositional Mu-Calculus , 1989, Inf. Comput..

[23]  Wolfgang Reisig.  Modeling- and Analysis Techniques for Web Services and Business Processes , 2005, FMOODS.

[24]  Rajeev Alur,et al.  Model-Checking in Dense Real-time , 1993, Inf. Comput..

[25]  Matjaz B. Juric,et al.  Business process execution language for web services , 2004 .

[26]  Eugene Asarin,et al.  Balanced timed regular expressions , 2002, Electron. Notes Theor. Comput. Sci..

[27]  Robin Milner,et al.  Communicating and mobile systems - the Pi-calculus , 1999 .

[28]  Massimo Bartoletti,et al.  Plans for service composition , 2006 .

[29]  Raman Kazhamiakin,et al.  Timed modelling and analysis in Web service compositions , 2006, First International Conference on Availability, Reliability and Security (ARES'06).

[30]  Alberto Martelli,et al.  Reasoning About Interaction Protocols for Web Service Composition , 2004, WSFM.

[31]  J. Cheney,et al.  A sequent calculus for nominal logic , 2004, LICS 2004.

[32]  Piergiorgio Bertoli,et al.  Automated composition of Web services via planning in asynchronous domains , 2005, Artif. Intell..

[33]  Antonio Vallecillo,et al.  Formalizing WSBPEL Business Processes Using Process Algebra , 2006, Electron. Notes Theor. Comput. Sci..

[34]  Theo Dimitrakos,et al.  Formal Aspects in Security and Trust, Fourth International Workshop, FAST 2006, Hamilton, Ontario, Canada, August 26-27, 2006, Revised Selected Papers , 2007, Formal Aspects in Security and Trust.

[35]  Andrea Ferrara,et al.  Web services: a process algebra approach , 2004, ICSOC '04.

[36]  Gian Luigi Ferrari,et al.  Types and effects for secure service orchestration , 2006, 19th IEEE Computer Security Foundations Workshop (CSFW'06).

[37]  Roberto Gorrieri,et al.  Choreography and Orchestration: A Synergic Approach for System Design , 2005, ICSOC.

[38]  Irek Ulidowski,et al.  Extending Process Languages with Time , 1997, AMAST.

[39]  Fabio Martinelli,et al.  Partial model checking and theorem proving for ensuring security properties , 1998, Proceedings. 11th IEEE Computer Security Foundations Workshop (Cat. No.98TB100238).

[40]  Matthew Hennessy,et al.  A Temporal Process Algebra , 1990, FORTE.

[41]  Fabio Casati,et al.  On Temporal Abstractions of Web Service Protocols , 2005, CAiSE Short Paper Proceedings.