Communication and Concurrency
Computer-Aided Reasoning: An Approach
Computer-Aided Reasoning: An Approach
Service Interaction Modeling: Bridging Global and Local Views
EDOC '06 Proceedings of the 10th IEEE International Enterprise Distributed Object Computing Conference
Precise Steps for Choreography Modeling for SOA Validation and Verification
SOSE '08 Proceedings of the 2008 IEEE International Symposium on Service-Oriented System Engineering
Formal Modelling and Analysis of Business Information Applications with Fault Tolerant Middleware
ICECCS '09 Proceedings of the 2009 14th IEEE International Conference on Engineering of Complex Computer Systems
Applying Model Checking to Generate Model-Based Integration Tests from Choreography Models
TESTCOM '09/FATES '09 Proceedings of the 21st IFIP WG 6.1 International Conference on Testing of Software and Communication Systems and 9th International FATES Workshop
Bridging the gap between fair simulation and trace inclusion
Information and Computation
Local enforceability in interaction Petri nets
BPM'07 Proceedings of the 5th international conference on Business process management
WofBPEL: a tool for automated analysis of BPEL processes
ICSOC'05 Proceedings of the Third international conference on Service-Oriented Computing
Let's dance: a language for service behavior modeling
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part I
Software and Systems Modeling (SoSyM)
Hi-index | 0.00 |
Choreography models describe the communication protocols between services. Every choreography model can be considered either from a global or from a local point of view. The global model specifies a high-level view of the conversation between service components, and can be considered as being interpreted from an observer point of view. The local model is derived from the global model, and specifies the communication-relevant behavior of each component.The connection between global and local models is achieved differently by connecting observing steps with either the send steps or with the receive steps. The consistency of the global model and the local model can be assured by the local enforceability property: any behavior that the local model permits is also possible to observe in the global model. Another important property of choreography models requires the absence of inconsumable messages, i.e., any messages ready to be received may always be received. In this paper, we study the relations between local enforceability and inconsumable messages in case that the local model is obtained from the global model without modification or further constraints. As a part of the conclusions, we show that if a choreography model is free of inconsumable messages, it is also local enforceable no matter how the global model is connected with the local one. This is a desired result because the mechanical checking ofinconsumable messages is much more efficient than that of local enforceability. In case of finite state systems one can check the absence of inconsumable messages in a linear time in the size of the local model, whereas checking local enforceability has an exponential complexity.