Please use this identifier to cite or link to this item:
Title: Runtime monitoring processes across blockchains
Authors: Azzopardi, Shaun
Ellul, Joshua
Pace, Gordon J.
Keywords: Blockchains (Databases) -- Case studies
Business records
Computer networks -- Monitoring
Issue Date: 2021
Publisher: Springer
Citation: Azzopardi, S., Ellul, J., & Pace, G. J. (2021). Runtime monitoring processes across blockchains. In H. Hojjat, & M. Massink (Eds.), International Conference on Fundamentals of Software Engineering (pp. 142-156). Cham: Springer.
Abstract: Business processes have been long researched, with many tools, languages, and diagrammatic notations having been developed for automation. Recently, distributed ledger technology (of which Blockchain is one type) has been proposed for use in the monitoring of business process compliance. Such a setup is attractive since it allows for immutability and thus a perfect record of the history of the business process regulated. As blockchain platforms mature and their applications increase, one can observe that instead of having one blockchain as a ‘one world computer’ multiple blockchains will co-exist while possibly interacting. Existing work for business processes within the blockchain domain have focused on single isolated blockchain implementations. In this paper, we do away with this severely limiting assumption and propose a method to monitor business processes spanning different blockchains and other off-chain servers. We apply this work to business processes expressed in BPMN along with annotations proposed for a blockchain context. We further describe how we handle blockchain interoperability by synthesizing automatically off-chain monitors, acting as notaries, that handle message passing between blockchain systems, and how we employ hash-locking for cryptographically secure token swapping.
Appears in Collections:Scholarly Works - CenDLT
Scholarly Works - FacICTCS

Files in This Item:
File Description SizeFormat 
  Restricted Access
441.69 kBAdobe PDFView/Open Request a copy

Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.