Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Relaxed Soundness of Business Processes
CAiSE '01 Proceedings of the 13th International Conference on Advanced Information Systems Engineering
The P2P Approach to Interorganizational Workflows
CAiSE '01 Proceedings of the 13th International Conference on Advanced Information Systems Engineering
APCCM '05 Proceedings of the 2nd Asia-Pacific conference on Conceptual modelling - Volume 43
Analyzing Conversations of Web Services
IEEE Internet Computing
Analyzing Compatibility of BPEL Processes
AICT-ICIW '06 Proceedings of the Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services
Behavioral matchmaking for service retrieval
ICWS '06 Proceedings of the IEEE International Conference on Web Services
Analyzing interacting WS-BPEL processes using flexible model generation
Data & Knowledge Engineering
MC-SOG: An LTL Model Checker Based on Symbolic Observation Graphs
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
Contracting workflows and protocol patterns
BPM'03 Proceedings of the 2003 international conference on Business process management
Workflow model compositions preserving relaxed soundness
BPM'06 Proceedings of the 4th international conference on Business Process Management
Analyzing web service based business processes
FASE'05 Proceedings of the 8th international conference, held as part of the joint European Conference on Theory and Practice of Software conference on Fundamental Approaches to Software Engineering
Satisfaction and coherence of deadline constraints in inter-organizational workflows
OTM'10 Proceedings of the 2010 international conference on On the move to meaningful internet systems - Volume Part I
Symbolic abstraction and deadlock-freeness verification of inter-enterprise processes
Data & Knowledge Engineering
International Journal of Web Services Research
Hi-index | 0.00 |
The design of complex inter-enterprise business processes (IEBP) is generally performed in a modular way. Each process is designed separately from the others and then the whole IEBP is obtained by composition. Even if such a modular approach is intuitive and facilitates the design problem, it poses the problem that correct behavior of each business process of the IEBP taken alone does not guarantee a correct behavior of the composed IEBP (i.e. properties are not preserved by composition). Proving correctness of the (unknown) composed process is strongly related to the model checking problem of a system model. Among others, the symbolic observation graph based approach has proven to be very helpful for efficient model checking in general. Since it is heavily based on abstraction techniques and thus hides detailed information about system components that are not relevant for the correctness decision, it is promising to transfer this concept to the problem rised in this paper: How can the symbolic observation graph technique be adapted and employed for process composition? Answering this question is the aim of this paper.