Multi-criteria Decision Analysis for Change Negotiation in Process Collaborations

Fdhila, Walid; Indiono, Conrad; Rinderle-Ma, Stefanie; Vetschera, Rudolf

doi:10.1109/edoc.2017.31

Cited by 4 publications

(2 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Change management at runtime in procedural processes has been studied in [7] where change propagation algorithms ensure behavioral and structural sound-ness of choreography partners private processes after the change. In [15,8], authors consider the change negotiation phase but no mechanism is proposed to ensure that all partners have trustfully applied the change, and no blockchain is used to deal with this problem.…”

Section: Related Workmentioning

confidence: 99%

A Trustworthy decentralized Change Propagation Mechanism for Declarative Choreographies

Brahem

Henry

Bhiri

et al. 2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Blockchain technologies have emerged to serve as a trust basis for the monitoring and execution of business processes, particularly business process choreographies. However, dealing with changes in smart contract-enabled business processes remains an open issue. For any required modification to an existing smart contract (SC), a new version of the SC with a new address is deployed on the blockchain and stored in a contract registry. Moreover, in a choreography, a change in a partner process might affect the processes of other partners. Thus, the change effect must be propagated to partners of the choreography affected by the change. In this paper, we propose a new approach overcoming the limitations of SCs and allowing for the change management of blockchain-enabled declarative business process choreographies modeled as DCR graphs. Our approach allows a partner in a running blockchainbased DCR choreography instance to change its private DCR process. A change impacting other partners is propagated to their affected processes using a SC. The change propagation mechanism ensures the compatibility checks between public DCR processes of the partners. We demonstrate the approach's feasibility through an implemented prototype.

show abstract

Section: Related Workmentioning

confidence: 99%

A Trustworthy decentralized Change Propagation Mechanism for Declarative Choreographies

Brahem

Henry

Bhiri

et al. 2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Utilities represent the satisfaction experienced by consumers with goods [29]. If such representation is adopted in service-based computing, both the service provider and the consumer can be assumed to have a preference [30] in the form of service objective, where normally, the service provider will try their best to meet the objectives of the consumer. This means that the preference of one party can be mapped on a utility value [15][31] [32], and the higher the utility value, the higher the preference value.…”

Section: Introductionmentioning

confidence: 99%

Towards Service Level Agreement Quantification on Service-Based Computing

Paputungan

Denna

Rachmawati

2022

Jurnal Ilmiah Teknik Elektro Komputer Dan Informatika

View full text Add to dashboard Cite

A service Level Agreement is an agreement between service providers and consumers that contains the rights and obligations of both parties, particularly in terms of the delivery of services provided during the subscription period on service-based computing. Once approved, normally, the Service Level Agreement will not change until the end of the subscription period. SLA violations are often positioned between yes and no. As a result, service providers must deal with severe penalties or compensation. In this paper, the use of weightage for each SLA parameter is introduced in this paper. Such quantification using weightage is the main contribution. SLA violation detection cases in service-based computing are used to demonstrate how SLA quantification works. In the simulation scenario of SLA quantification, the presence of weightage and its aggregates along with the upper and lower bound is able to help the SLA violation detection process more appropriate. Violations are no longer seen between Yes and No, but the severity of the violation can also be determined. The number of violated parameters is not very influential in determining the level because the main determinant is the weightage. At the same time, the upper and lower limits are also very helpful in determining the level of violation. It is believed that SLA quantification is the way forward for better SLA management.

show abstract

Dealing with the Evolution of Event-Based Choreographies of BPMN Fragments: Definition and Proof of Concept

Ortiz,

Torres,

Valderas

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Multi-criteria Decision Analysis for Change Negotiation in Process Collaborations

Cited by 4 publications

References 16 publications

A Trustworthy decentralized Change Propagation Mechanism for Declarative Choreographies

A Trustworthy decentralized Change Propagation Mechanism for Declarative Choreographies

Towards Service Level Agreement Quantification on Service-Based Computing

Dealing with the Evolution of Event-Based Choreographies of BPMN Fragments: Definition and Proof of Concept

Contact Info

Product

Resources

About