Component-based software architectures: a framework based on inheritance of behavior
Science of Computer Programming
Relaxed Soundness of Business Processes
CAiSE '01 Proceedings of the 13th International Conference on Advanced Information Systems Engineering
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Inheritance of Interorganizational Workflows: How to Agree to Disagree Without Loosing Control?
Information Technology and Management
Behavioral matchmaking for service retrieval
ICWS '06 Proceedings of the IEEE International Conference on Web Services
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
Petrifying Operating Guidelines for Services
ACSD '09 Proceedings of the 2009 Ninth International Conference on Application of Concurrency to System Design
Soundness and separability of workflow nets in the stepwise refinement approach
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
WISEW'03 Proceedings of the Fourth international conference on Web information systems engineering workshops
Symbolic abstraction and deadlock-freeness verification of inter-enterprise processes
Data & Knowledge Engineering
Interaction soundness for service orchestrations
ICSOC'06 Proceedings of the 4th international conference on Service-Oriented Computing
Workflow model compositions preserving relaxed soundness
BPM'06 Proceedings of the 4th international conference on Business Process Management
International Journal of Web Services Research
Hi-index | 0.00 |
The Symbolic Observation Graph (SOG) associated with a labelled transition system and a subset of its labels is an efficient BDD-based abstraction representing the behavior of a system. The goal of this paper is to compose SOGs such that the resulting SOG is still small but represents the behavior of the composed business process in an appropriate way. In particular, we would like to deduce the properties of a composed business process by analysing the composition of the SOGs associated with its components. This question was already answered for the deadlock-freeness property in previous work. In this paper, we extend this result to other generic properties: the so-called soundness properties. These properties guarantee the absence of livelocks, deadlocks and other anomalies that can be formulated without domain knowledge. Thus, we show how the SOG can be adapted and used so that the verification of several variants of the soundness property can be performed modularly.