Communication and concurrency
Inheritance of workflows: an approach to tackling problems related to change
Theoretical Computer Science
Modular Construction and Partial Order Semantics of Petri Nets
Modular Construction and Partial Order Semantics of Petri Nets
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
A Compositional Partial Order Semantics for Petri Net Components
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
WWW '05 Proceedings of the 14th international conference on World Wide Web
Operating Guidelines - an Automata-Theoretic Foundation for the Service-Oriented Architecture
QSIC '05 Proceedings of the Fifth International Conference on Quality Software
Representing, analysing and managing web service protocols
Data & Knowledge Engineering - Special issue: ER 2004
A theory of contracts for web services
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Can I find a partner? Undecidability of partner existence for open nets
Information Processing Letters
Behavioral consistency for B2B process integration
CAiSE'07 Proceedings of the 19th international conference on Advanced information systems engineering
Operating guidelines for finite-state services
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Contract based multi-party service composition
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
A behavioural congruence for web services
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
From public views to private views: correctness-by-design for services
WS-FM'07 Proceedings of the 4th international conference on Web services and formal methods
Behavioral constraints for services
BPM'07 Proceedings of the 5th international conference on Business process management
When are two web services compatible?
TES'04 Proceedings of the 5th international conference on Technologies for E-Services
Analyzing interacting BPEL processes
BPM'06 Proceedings of the 4th international conference on Business Process Management
Service Interaction: Patterns, Formalization, and Analysis
Formal Methods for Web Services
Set Algebra for Service Behavior: Applications and Constructions
BPM '09 Proceedings of the 7th International Conference on Business Process Management
Another Approach to Service Instance Migration
ICSOC-ServiceWave '09 Proceedings of the 7th International Joint Conference on Service-Oriented Computing
How to implement a theory of correctness in the area of business processes and services
BPM'10 Proceedings of the 8th international conference on Business process management
A trace-based view on operating guidelines
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Constructing replaceable services using operating guidelines and maximal controllers
WS-FM'10 Proceedings of the 7th international conference on Web services and formal methods
Wendy: a tool to synthesize partners for services
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Compact Representations and Efficient Algorithms for Operating Guidelines
Fundamenta Informaticae - Application of Concurrency to System Design, the Eighth Special Issue
Wendy: A Tool to Synthesize Partners for Services
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2010
Hi-index | 0.00 |
Deciding whether a service S can be substituted by another service S *** is an important problem in practice and one of the research challenges in service-oriented computing. In this paper, we define three substitutability notions for services. Accordance specifies that S *** cooperates with at least the environments that S cooperates with. S and S *** are equivalent if they cooperate with the same environments. To guarantee that S *** cooperates with a fixed subset of environments that S cooperates with, the notion of restriction can be used. For each substitutability notion we present a decision algorithm. To this end we apply the concept of an operating guideline of a service as an abstract representation of all environments the service cooperates with.