@article{mallya_singh_2007, title={An algebra for commitment protocols}, volume={14}, ISSN={["1573-7454"]}, url={http://www.scopus.com/inward/record.url?eid=2-s2.0-33846465461&partnerID=MN8TOARS}, DOI={10.1007/s10458-006-7232-1}, number={2}, journal={AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS}, author={Mallya, Ashok U. and Singh, Munindar P.}, year={2007}, month={Apr}, pages={143–163} }
 @book{mallya_singh_2006, title={Incorporating commitment protocols into tropos}, volume={3950}, ISBN={3540340971}, journal={Agent-Oriented Software Engineering VI : 6th International Workshop, AOSE 2005, Utrecht, The Netherlands, July 25, 2005.}, publisher={Berlin: Springer}, author={Mallya, A. U. and Singh, M. P.}, year={2006}, pages={69–80} }
 @article{mallya_singh_2005, title={A semantic approach for designing commitment protocols}, volume={3396}, ISBN={3540250158}, url={https://publons.com/publon/21294472/}, DOI={10.1007/978-3-540-32258-0_3}, abstractNote={Protocols enable unambiguous and smooth interactions among agents, and commitments among agents are a powerful means of developing protocols. Commitments allow flexible execution of protocols and help agents reason about protocols and plan their actions accordingly, while at the same time providing a basis for compliance checking. Multiagent systems that employ commitment-based interaction can conveniently and effectively model business interactions because the autonomy and heterogeneity of agents mirrors real-world businesses. Such modeling, however, requires multiagent systems to host a rich variety of interaction protocols that can capture the needs of different applications. We show how a commitment-based semantics for protocols provides a basis for refining and aggregating protocols. We propose an approach for designing commitment protocols wherein traditional software engineering notions such as refinement and aggregation are extended to apply to protocols. We present an algebra of protocols that can be used to compose protocols by refining and merging existing ones, and does this at a level of abstraction high enough to be useful for real-world applications.}, journal={Lecture Notes in Computer Science}, publisher={Berlin; New York: Springer}, author={Mallya, A. U. and Singh, Munindar P.}, editor={Eijk, M-P. Huget and Dignum, F.Editors}, year={2005}, pages={33–49} }
 @article{mallya_singh_2005, title={A semantic approach for designing e-business protocols}, volume={3387}, ISBN={3540243283}, url={https://publons.com/publon/21294471/}, DOI={10.1007/978-3-540-30581-1_10}, abstractNote={Business processes involve interactions among autonomous partners. We propose that these interactions be specified modularly as protocols. Protocols can be published, enabling implementors to independently develop components that respect published protocols and yet serve diverse interests. A variety of business protocols would be needed to capture subtle business needs. We propose that the same kinds of conceptual abstractions be developed for protocols as for information models. Specifically, we consider (1) refinement: a subprotocol may satisfy the requirements of a superprotocol, but support additional properties; and (2) aggregation: a protocol may combine existing protocols. In support of the above, this paper develops a semantics of protocols and an operational characterization of them. This supports judgments about the potential subclass-superclass relations between protocols, which are a result of protocol refinement. It also enables protocol aggregation by splicing a protocol into another protocol.}, journal={IEEE INTERNATIONAL CONFERENCE ON WEB SERVICES, PROCEEDINGS}, publisher={Berlin; New York: Springer}, author={Mallya, A. U. and Singh, Munindar P.}, editor={J. Cardoso and Sheth, A.Editors}, year={2005}, pages={111–123} }
 @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{mallya_huhns_2003, title={Commitments among agents}, volume={7}, ISSN={["1089-7801"]}, DOI={10.1109/MIC.2003.1215666}, abstractNote={Commitments are a powerful representation for modeling multiagent interactions. Previous approaches have considered the semantics of commitments and how to check compliance with them. However, these approaches do not capture some of the subtleties that arise in real-life applications such as e-commerce, in which contracts and institutions have implicit temporal references. In this column, we describe a rich representation for the temporal content of commitments that lets us capture realistic contracts and avoid ambiguities. Consequently, this approach lets us reason about whether, and at what point, a commitment is satisfied or breached, and whether it is or ever becomes unenforceable.}, number={4}, journal={IEEE INTERNET COMPUTING}, author={Mallya, AU and Huhns, MN}, year={2003}, pages={90–93} }
 @article{mallya_yolum_singh_2003, title={Resolving commitments among autonomous agents}, volume={2922}, ISBN={3540207694}, url={https://publons.com/publon/13074008/}, DOI={10.1007/978-3-540-24608-4_10}, abstractNote={Commitments are a powerful representation for modeling multiagent interactions. Previous approaches have considered the semantics of commitments and how to check compliance with them. However, these approaches do not capture some of the subtleties that arise in real-life applications, e.g., e-commerce, where contracts and institutions have implicit temporal references. The present paper develops a rich representation for the temporal content of commitments. This enables us to capture realistic contracts and institutions rigorously, and avoid subtle ambiguities. Consequently, this approach enables us to reason about whether and when exactly a commitment is satisfied or breached and whether it is or ever becomes unenforceable.}, journal={Lecture Notes in Computer Science}, publisher={Berlin; New York: Springer}, author={Mallya, A. U. and Yolum, P. and Singh, Munindar P.}, year={2003}, pages={166–182} }