@inproceedings{singh_desai_2010, title={Multidisciplinary views of business contracts}, volume={6470}, booktitle={Service-oriented computing}, author={Singh, M. P. and Desai, N.}, year={2010}, pages={730–730} }
 @article{singh_chopra_desai_2009, title={Commitment-Based Service-Oriented Architecture}, volume={42}, ISSN={["0018-9162"]}, url={http://www.scopus.com/inward/record.url?eid=2-s2.0-70350222918&partnerID=MN8TOARS}, DOI={10.1109/MC.2009.347}, abstractNote={Existing service-oriented architectures are formulated in terms of low-level abstractions far removed from business services. In a new SOA, the components are business services and the connectors are patterns, modeled as commitments, that support key elements of service engagements.}, number={11}, journal={COMPUTER}, author={Singh, Munindar P. and Chopra, Amit K. and Desai, Nirmit}, year={2009}, month={Nov}, pages={72–79} }
 @article{desai_mallya_chopra_singh_2005, title={Interaction Protocols as design abstractions for business processes}, volume={31}, ISSN={["1939-3520"]}, url={http://www.scopus.com/inward/record.url?eid=2-s2.0-33745865103&partnerID=MN8TOARS}, DOI={10.1109/TSE.2005.140}, abstractNote={Business process modeling and enactment are notoriously complex, especially in open settings, where business partners are autonomous, requirements must be continually finessed, and exceptions frequently arise because of real-world or organizational problems. Traditional approaches, which attempt to capture processes as monolithic flows, have proven inadequate in addressing these challenges. We propose (business) protocols as components for developing business processes. A protocol is an abstract, modular, publishable specification of an interaction among different roles to be played by different participants. When instantiated with the participants' internal policies, protocols yield concrete business processes. Protocols are reusable and refinable, thus simplifying business process design. We show how protocols and their composition are theoretically founded in the phi;-calculus.}, number={12}, journal={IEEE TRANSACTIONS ON SOFTWARE ENGINEERING}, author={Desai, N and Mallya, AU and Chopra, AK and Singh, MP}, year={2005}, month={Dec}, pages={1015–1027} }
 @article{singh_chopra_desai_mallya_2004, title={Protocols for processes}, volume={39}, ISSN={0362-1340}, url={http://dx.doi.org/10.1145/1052883.1052893}, DOI={10.1145/1052883.1052893}, abstractNote={
            The modeling and enactment of business processes is being recognized as key to modern information managment. The expansion of Web services has increased the attention given to processes, because processes are how services are composed and put to good use. However, current approaches are inadequate for flexibly modeling and enacting processes. These approaches take a logically centralized view of processes, treating a process as an implementation of a composed service. They provide low-level scripting languages to specify how a service may be implemented, rather than what interactions are expected from it. Consequently, existing approaches fail to adequately accommodate the essential properties of the business partners in a process (the partners would be realized via services)---their
            autonomy
            (freedom of action),
            heterogeneity
            (freedom of design), and
            dynamism
            (freedom of configuration).Flexibly represented
            protocols
            can provide a more natural basis for specifying processes. Protocols specify
            what
            rather than
            how
            ; thus they naturally maximize the authonomy, heterogeneity, and dynamism of the interacting parties. We are developing an approach for modeling and enacting business processes based on protocols. This paper describes some elements of (1) a conceptual model of processes that will incorporate abstractions based on protocols, roles, and commitments; (2)the semantics or mathematical foundations underlying the conceptual model and mapping global views of processes to the local actions of the parties involved; (3) methodologies involving rule-based reasoning to specify processes in terms of compositions of protocols.
          }, number={12}, journal={ACM SIGPLAN Notices}, publisher={Association for Computing Machinery (ACM)}, author={Singh, Munindar P. and Chopra, Amit K. and Desai, Nirmit and Mallya, Ashok U.}, year={2004}, month={Dec}, pages={73} }
 @article{desai_mueller_2004, title={Scalable hierarchical locking for distributed systems}, volume={64}, ISSN={["1096-0848"]}, DOI={10.1016/j.jpdc.2003.10.001}, abstractNote={Middleware components are becoming increasingly important as applications share computational resources in distributed environments, such as high-end clusters with ever larger number of processors, computational grids and increasingly large server farms. One of the main challenges in such environments is to achieve scalability of synchronization. In general, concurrency services arbitrate resource requests in distributed systems. But concurrency protocols currently lack scalability. Adding such guarantees enables resource sharing and computing with distributed objects in systems with a large number of nodes.

The objective of our work is to enhance middleware services to provide scalability of synchronization and to support state replication in distributed systems. We have designed and implemented a middleware protocol in support of these objectives. Its essence is a peer-to-peer protocol for multi-mode hierarchical locking, which is applicable to transaction-style processing and distributed agreement. We demonstrate high scalability combined with low response times in high-performance cluster environments. Our technical contribution is a novel, fully decentralized, hierarchical locking protocol to enhance concurrency in distributed resource allocation following the specification of general concurrency services for large-scale data and object repositories. Our experiments on an IBM SP show that the number oF messages approaches an asymptote at 15 node from which point on the message overhead is in the order of 3-9 messages per request, depending on system parameters. At the same time, response times increase linearly with a proportional increase in requests and, consequently, higher concurrency levels. Specifically, in the range of up to 80 nodes, response times under 10 ms are observed for critical sections that are one 25th the size of noncritical code. The high degree of scalability and responsiveness of our protocol is due in large to a high level of concurrency upon resolving requests combined with dynamic path compression for request propagation paths. Our approach is not only applicable to CORBA, its principles are shown to provide benefits to general distributed concurrency services and transaction models. Besides its technical strengths, our approach is intriguing due to its simplicity and its wide applicability, ranging From large-scale clusters to server-style computing.}, number={6}, journal={JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING}, author={Desai, N and Mueller, F}, year={2004}, month={Jun}, pages={708–724} }
 @article{tai_mikalsen_wohlstadter_desai_rouvellou_2004, title={Transaction policies for service-oriented computing}, volume={51}, ISSN={["1872-6933"]}, DOI={10.1016/j.datak.2003.03.001}, abstractNote={Service-oriented computing is emerging as a distributed computing model where autonomous services interact with each other using standard Internet technology. In addition to the application-specific functions that services provide (different) services may also support (different) sets of protocols and formats addressing extra-functional concerns such as transaction processing and reliable messaging. This raises the need for services to complement their functional service descriptions with descriptions of extra-functional capabilities, requirements, and/or preferences, which must be matched and enforced for service interactions. In this paper, we address the problem of transactional coordination in service-oriented computing. We argue for the use of declarative policy assertions to advertise and match support for different transaction styles (direct transaction processing, queued transaction processing, and compensation-based transaction processing), and introduce the concept of and system support for transaction coupling modes as the policy-based contracts guiding transactional business process execution. We focus on concrete, protocol-specific policies that apply to relevant Web services specifications. Using transaction policies and our middleware system, we are able to support a reliable SOC environment.}, number={1}, journal={DATA & KNOWLEDGE ENGINEERING}, author={Tai, S and Mikalsen, T and Wohlstadter, E and Desai, N and Rouvellou, I}, year={2004}, month={Oct}, pages={59–79} }