Constructing Replaceable Services Using Operating Guidelines and Maximal Controllers

Service-oriented systems support process evolution by allowing the replacement of a service S by another service T. To maintain proper interaction in the overall system, service T should interact properly with all controllers (i. e., in all contexts) of service S. To support the construction of such services T, we compute operating guidelines that represent all services that can replace service S. Our computation relies on the additional notion of a maximal controller. Maximal controllers can also be used for deciding whether a service T can replace service S, and for computing a public view that hides service details that are not relevant for controllers.

[1]  Niels Lohmann,et al.  Correcting Deadlocking Service Choreographies Using a Simulation-Based Graph Edit Distance , 2008, BPM.

[2]  Christian Stahl,et al.  Deciding Substitutability of Services with Operating Guidelines , 2009, Trans. Petri Nets Other Model. Concurr..

[3]  Arjan J. Mooij,et al.  Proof Techniques for Adapter Generation , 2009, WS-FM.

[4]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[5]  Carl A. Sunshine,et al.  Protocol Specification, Testing and Verification - Guest Editorial , 1982, Comput. Networks.

[6]  Antonio Brogi,et al.  A Net-based Approach to Web Services Publication and Replaceability , 2009, Fundam. Informaticae.

[7]  Karsten Wolf,et al.  Covering Places and Transitions in Open Nets , 2008, BPM.

[8]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[9]  Rik Eshuis,et al.  Composing Services into Structured Processes , 2009, Int. J. Cooperative Inf. Syst..

[10]  Arjan J. Mooij,et al.  Trading Off Concurrency to Generate Behavioral Adapters , 2009, 2009 Ninth International Conference on Application of Concurrency to System Design.

[11]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[12]  Luca Padovani,et al.  Foundations of session types , 2009, PPDP '09.

[13]  Farhad Arbab,et al.  International Symposium on Fundamentals of Software Engineering, International Symposium, FSEN 2007, Tehran, Iran, April 17-19, 2007, Proceedings , 2007, FSEN.

[14]  Niels Lohmann,et al.  Extending the compatibility notion for abstract WS-BPEL processes , 2008, WWW.

[15]  Mario Bravetti,et al.  Contract based multi-party service composition , 2007, FSEN'07.

[16]  Walter Vogler,et al.  Modular Construction and Partial Order Semantics of Petri Nets , 1992, Lecture Notes in Computer Science.

[17]  Karsten Wolf,et al.  Does My Service Have Partners? , 2009, Trans. Petri Nets Other Model. Concurr..

[18]  Wil M. P. van der Aalst,et al.  From Public Views to Private Views - Correctness-by-Design for Services , 2007, WS-FM.

[19]  Karsten Wolf,et al.  A finite representation of all substitutable services and its applications , 2009, ZEUS.

[20]  Andrew D. Gordon,et al.  Verified Reference Implementations of WS-Security Protocols , 2006, WS-FM.

[21]  Roland Carl Backhouse,et al.  Galois Connections and Fixed Point Calculus , 2000, Algebraic and Coalgebraic Methods in the Mathematics of Program Construction.

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

[23]  Peter Massuthe,et al.  Operating guidelines for services , 2009 .

[24]  Cosimo Laneve,et al.  The Must Preorder Revisited , 2007, CONCUR.

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

[26]  Kim G. Larsen,et al.  On Modal Refinement and Consistency , 2007, CONCUR.

[27]  Fabio Casati,et al.  Representing, analysing and managing Web service protocols , 2006, Data Knowl. Eng..

[28]  Mike P. Papazoglou,et al.  The Challenges of Service Evolution , 2008, CAiSE.

[29]  C. A. R. Hoare,et al.  Stuck-Free Conformance , 2004, CAV.

[30]  Jetty Kleijn,et al.  Petri Nets and Other Models of Concurrency - ICATPN 2007, 28th International Conference on Applications and Theory of Petri Nets and Other Models of Concurrency, ICATPN 2007, Siedlce, Poland, June 25-29, 2007, Proceedings , 2007, ICATPN.

[31]  Roland Carl Backhouse,et al.  Algebraic and Coalgebraic Methods in the Mathematics of Program Construction , 2000, Lecture Notes in Computer Science.

[32]  Frank Leymann,et al.  Web services and business process management , 2002, IBM Syst. J..

[33]  David L. Dill,et al.  Trace theory for automatic hierarchical verification of speed-independent circuits , 1989, ACM distinguished dissertations.

[34]  Niels Lohmann,et al.  Operating Guidelines for Finite-State Services , 2007, ICATPN.

[35]  Mathias Weske,et al.  The P2P Approach to Interorganizational Workflows , 2001, International Conference on Advanced Information Systems Engineering.

[36]  Kees M. van Hee,et al.  Soundness-Preserving Refinements of Service Compositions , 2010, WS-FM.