On Communicating Finite-State Machines
Journal of the ACM (JACM)
Model checking
Communication and Concurrency
Getting Erlang to talk to the outside world
Proceedings of the 2002 ACM SIGPLAN workshop on Erlang
Language Primitives and Type Discipline for Structured Communication-Based Programming
ESOP '98 Proceedings of the 7th European Symposium on Programming: Programming Languages and Systems
A Case for Message Oriented Middleware
Proceedings of the 13th International Symposium on Distributed Computing
Conversation specification: a new approach to design and analysis of e-service composition
WWW '03 Proceedings of the 12th international conference on World Wide Web
Analysis of interacting BPEL web services
Proceedings of the 13th international conference on World Wide Web
Web Services Platform Architecture: SOAP, WSDL, WS-Policy, WS-Addressing, WS-BPEL, WS-Reliable Messaging and More
Theoretical Computer Science - Implementation and application of automata
MOM vs. RPC: Communication Models for Distributed Applications
IEEE Internet Computing
Synchronizability of Conversations among Web Services
IEEE Transactions on Software Engineering
Analysis of communication models in web service compositions
Proceedings of the 15th international conference on World Wide Web
Language support for fast and reliable message-based communication in singularity OS
Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
Singularity: rethinking the software stack
ACM SIGOPS Operating Systems Review - Systems work at Microsoft Research
Multiparty asynchronous session types
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Non-desynchronizable Service Choreographies
ICSOC '08 Proceedings of the 6th International Conference on Service-Oriented Computing
Analyzing singularity channel contracts
Proceedings of the eighteenth international symposium on Software testing and analysis
Automata-theoretic model checking revisited
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Deciding choreography realizability
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Synchronizability for verification of asynchronously communicating systems
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Passive conformance testing of service choreographies
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Checking the realizability of BPMN 2.0 choreographies
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Reliable contracts for unreliable half-duplex communications
WS-FM'11 Proceedings of the 8th international conference on Web Services and Formal Methods
A symbolic framework for the conformance checking of value-passing choreographies
ICSOC'12 Proceedings of the 10th international conference on Service-Oriented Computing
A model-based synthesis process for choreography realizability enforcement
FASE'13 Proceedings of the 16th international conference on Fundamental Approaches to Software Engineering
Algorithms for checking channel passing in web service choreography
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |
Choreography analysis has been a crucial problem in service oriented computing. Interactions among services involve message exchanges across organizational boundaries in a distributed computing environment, and in order to build such systems in a reliable manner, it is necessary to develop techniques for analyzing such interactions. Choreography conformance involves verifying that a set of services behave according to a given choreography specification that characterizes their interactions. Unfortunately this is an undecidable problem when services interact with asynchronous communication. In this paper we present techniques that identify if the interaction behavior for a set of services remain the same when asynchronous communication is replaced with synchronous communication. This is called the synchronizability problem and determining the synchronizability of a set of services has been an open problem for several years. We solve this problem in this paper. Our results can be used to identify synchronizable services for which choreography conformance can be checked efficiently. Our results on synchronizability are applicable to any software infrastructure that supports message-based interactions.