Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Agent-oriented technology in support of e-business
Communications of the ACM
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
E-services: a look behind the curtain
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Analysis of interacting BPEL web services
Proceedings of the 13th international conference on World Wide Web
Logic-based Web Services Composition: From Service Description to Process Model
ICWS '04 Proceedings of the IEEE International Conference on Web Services
Web services: a process algebra approach
Proceedings of the 2nd international conference on Service oriented computing
Covering Places and Transitions in Open Nets
BPM '08 Proceedings of the 6th International Conference on Business Process Management
Petri Net Transformations for Business Processes --- A Survey
Transactions on Petri Nets and Other Models of Concurrency II
Does My Service Have Partners?
Transactions on Petri Nets and Other Models of Concurrency II
Deciding Substitutability of Services with Operating Guidelines
Transactions on Petri Nets and Other Models of Concurrency II
Automatic Test Case Generation for Interacting Services
Service-Oriented Computing --- ICSOC 2008 Workshops
Deciding service composition and substitutability using extended operating guidelines
Data & Knowledge Engineering
The Computer Journal
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
Behavioral constraints for services
BPM'07 Proceedings of the 5th international conference on Business process management
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 foundational approach for managing process variability
CAiSE'11 Proceedings of the 23rd international conference on Advanced information systems engineering
| Hi-index | 0.00 |
Compatibility of behavior , i.e. the correct ordering of messages, is one of the core aspects for the interaction between services as parts of an inter-organizational business process. In previous work, we proposed formal representations for service behavior (including Petri nets and service automata) and finite representations of sets thereof (operating guidelines ). In this article, we show how the basic set operations union, intersection, and complement, as well as membership and emptiness tests, can be implemented on finite representations of (typically infinite) sets of services. We motivate the operations by three examples of applications--service substitution, selection of behavior, and navigation in a behavioral registry.