A Polynomial-Time Graph Algorithm to Decide Liveness of Some Basic Classes of Bounded Petri Nets
Proceedings of the 13th International Conference on Application and Theory of Petri Nets
A Petri net-based model for web service composition
ADC '03 Proceedings of the 14th Australasian database conference - Volume 17
WS-Net: A Petri-net Based Specification Model for Web Services
ICWS '04 Proceedings of the IEEE International Conference on Web Services
Analyzing interacting WS-BPEL processes using flexible model generation
Data & Knowledge Engineering
Transformation of BPEL Processes to Petri Nets
TASE '08 Proceedings of the 2008 2nd IFIP/IEEE International Symposium on Theoretical Aspects of Software Engineering
Research on Reachability Verification of Web Service Composition
WCSE '09 Proceedings of the 2009 WRI World Congress on Software Engineering - Volume 04
On the equivalence between liveness and deadlock-freeness in petri nets
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
| Hi-index | 0.00 |
A fundamental feature of service oriented computing is that simple services need to be composed for generating complex services. This work focuses on the analysis and verification of behavior models of web services composition. In particular, we have to check that neither deadlock nor livelock occurs in this composition. Usually, the verification of such integration, with or without mediators, is achieved by using techniques based on state space exploration of a given service formal model. In this paper, we present an approach based on structure theory of Petri nets allowing the recognition of necessary and/or sufficient conditions ensuring compatible composition and a better understanding of the incompatibility sources.