Realizability of Conversation Protocols with Message Contents

doi:10.4018/jwsr.2005100104

Reference Hub

This research has been cited in:

Conference
On Complexity of The Tightening Problem for Web Service DiscoveryIEEE International Conference on Service-Oriented Computing and Applications (SOCA '07)10.1109/SOCA.2007.33
Article
Structured Communication-Centered Programming for Web ServicesACM Transactions on Programming Languages and Systems10.1145/2220365.2220367
Chapter
The Evolution of JolieSoftware, Services, and Systems10.1007/978-3-319-15545-6_29
Chapter
Towards a Quality Model for ChoreographyService-Oriented Computing – ICSOC 200710.1007/978-3-642-16132-2_41
Chapter
Resolving Non-determinism in ChoreographiesProgramming Languages and Systems10.1007/978-3-642-54833-8_26
Article
Current trends in modeling inter‐organizational cooperationJournal of Enterprise Information Management10.1108/17410390910949724
Article
Specification of realizable service conversations using collaboration diagramsService Oriented Computing and Applications10.1007/s11761-008-0022-7
Article
A procedure for splitting data-aware processes and its application to coordinationScience of Computer Programming10.1016/j.scico.2014.02.017
Chapter
Service CompositionService Research Challenges and Solutions for the Future Internet10.1007/978-3-642-17599-2_3
Chapter
Analyzing Conversations: Realizability, Synchronizability, and VerificationTest and Analysis of Web Services10.1007/978-3-540-72912-9_3
Article
Partially distributed coordination with Reo and constraint automataService Oriented Computing and Applications10.1007/s11761-015-0177-y
Conference
Specification of Realizable Service Conversations Using Collaboration DiagramsIEEE International Conference on Service-Oriented Computing and Applications (SOCA '07)10.1109/SOCA.2007.41
Chapter
Service Choreography and Orchestration with ConversationsCONCUR 2008 - Concurrency Theory10.1007/978-3-540-85361-9_2
Conference
Deadlock-freedom-by-designProceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/2429069.2429101
Article
Deadlock-freedom-by-designACM SIGPLAN Notices10.1145/2480359.2429101
Conference
S-WFMS: A Service-Based Workflow Management System in Grid Environment19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers)10.1109/AINA.2005.301
Conference
Modeling Interactions of Web Software2nd International Workshop on Automated Specification and Verification of Web Systems (WWV'06)10.1109/WWV.2006.10
Conference
Decentralized Consistency Checking in Cross-organizationalWorkflowsThe 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (CEC/EEE'06)10.1109/CEC-EEE.2006.32
Article
Global consensus through local synchronization: A formal basis for partially-distributed coordinationScience of Computer Programming10.1016/j.scico.2015.09.001

Realizability of Conversation Protocols with Message Contents

Xiang Fu, Tevfik Bultan, Jianwen Su

Source Title: International Journal of Web Services Research (IJWSR)2(4)

Cite Article Cite Article

MLA

Fu, Xiang, et al. "Realizability of Conversation Protocols with Message Contents." IJWSR vol.2, no.4 2005: pp.68-93. http://doi.org/10.4018/jwsr.2005100104

APA

Fu, X., Bultan, T., & Su, J. (2005). Realizability of Conversation Protocols with Message Contents. International Journal of Web Services Research (IJWSR), 2(4), 68-93. http://doi.org/10.4018/jwsr.2005100104

Chicago

Fu, Xiang, Tevfik Bultan, and Jianwen Su. "Realizability of Conversation Protocols with Message Contents," International Journal of Web Services Research (IJWSR) 2, no.4: 68-93. http://doi.org/10.4018/jwsr.2005100104

Export Reference

Favorite Full-Issue Download

View Full Text PDF

Abstract

A promising way to model the global behavior of a Web Service composition is to characterize the set of conversations among the participating Web Services. A conversation protocol specifies the desired global behaviors of a Web Service composition. The realizability problem is to decide whether, given a conversation protocol, a Web Service composition can be synthesized that generates exactly the same set of conversations specified by the protocol. This is a key problem in the top-down specification of the Web Service compositions. In our earlier work, we developed sufficient conditions for realizability of conversation protocols based on a model that abstracts the contents of the messages. The present paper extends our earlier work by allowing message contents to be used in the realizability analysis. We show that taking the message contents into account yields more accurate analysis. To overcome the state-space explosion caused by the message contents, we propose symbolic analysis techniques for the realizability conditions. In addition, we show that the analysis of one of the realizability conditions — the autonomy condition — can be done using an iterative refinement approach.

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.

Username or email: *

Password: *

Forgot individual login password?

Create individual account

Realizability of Conversation Protocols with Message Contents

MLA

APA

Chicago

Export Reference

Abstract

Request Access