BPMN to Smart Contract by Business Analyst

• URL: http://arxiv.org/abs/2505.22612v1
• Date: Wed, 28 May 2025 17:28:38 GMT
• Title: BPMN to Smart Contract by Business Analyst
• Authors: C. G. Liu, P. Bodorik, D. Jutla,
• Abstract summary: This paper addresses the challenge of creating smart contracts for applications represented using Business Process Management and Notation (BPMN) models.<n>In our prior work we presented a methodology that automates the generation of smart contracts from BPMN models.<n>In subsequent research, we enhanced our approach by adding support for nested transactions and enabling a smart contract repair and/or upgrade.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: This paper addresses the challenge of creating smart contracts for applications represented using Business Process Management and Notation (BPMN) models. In our prior work we presented a methodology that automates the generation of smart contracts from BPMN models. This approach abstracts the BPMN flow control, making it independent of the underlying blockchain infrastructure, with only the BPMN task elements requiring coding. In subsequent research, we enhanced our approach by adding support for nested transactions and enabling a smart contract repair and/or upgrade. To empower Business Analysts (BAs) to generate smart contracts without relying on software developers, we tackled the challenge of generating smart contracts from BPMN models without assistance of a software developer. We exploit the Decision Model and Notation (DMN) standard to represent the decisions and the business logic of the BPMN task elements and amended our methodology for transformation of BPMN models into smart contracts to support also the generation script to represent the business logic represented by the DMN models. To support such transformation, we describe how the BA documents, using the BPMN elements, the flow of information along with the flow of execution. Thus, if the BA is successful in representing the blockchain application requirements using BPMN and DMN models, our methodology and the tool, called TABS, that we developed as a proof of concept, is used to generate the smart contracts directly from those models without developer assistance.

Related papers

• Leveraging Machine Learning and Enhanced Parallelism Detection for BPMN Model Generation from Text [75.77648333476776]
  This paper introduces an automated pipeline for extracting BPMN models from text.<n>A key contribution of this work is the introduction of a newly annotated dataset.<n>We augment the dataset with 15 newly annotated documents containing 32 parallel gateways for model training.
  arXiv  Detail & Related papers  (2025-07-11T07:25:55Z)
• Automated Mechanism to Support Trade Transactions in Smart Contracts with Upgrade and Repair [0.0]
  We present a methodology for repairing a smart contract that cannot be completed due to events that were not anticipated by the developer.<n>This paper describes the tool TABS+, developed by extending the TABS+ tool, to allow the repair of smart contracts.
  arXiv  Detail & Related papers  (2025-06-04T12:13:07Z)
• Transforming Automatically BPMN Models to Smart Contracts with Nested Collaborative Transactions (TABS+) [0.0]
  We use Business Process Model and Notation BPMN modeling to describe application requirements for trade of goods and services.<n>Our approach analyzes the BPMN model to determine which patterns in the BPMN model are suitable for use as collaborative transactions.<n>We describe how our approach automatically transform the BPMN model into smart contract the provides a transaction mechanism to enforce the transactional properties of the nested transactions.
  arXiv  Detail & Related papers  (2025-06-03T10:37:41Z)
• Supporting Long-term Transactions in Smart Contracts Generated from Business Process Model and Notation (BPMN) Models [0.0]
  The thesis examines and evaluates automatically generated alternative transaction mechanisms to support collaborative trade transactions.<n>The developed proof of concept shows that our approach to automated transformation of BPMN models into smart contracts with the support of privacy and cross-chain interoperability is feasible.
  arXiv  Detail & Related papers  (2025-05-30T07:47:06Z)
• Discriminative Policy Optimization for Token-Level Reward Models [55.98642069903191]
  Process reward models (PRMs) provide more nuanced supervision compared to outcome reward models (ORMs)<n>Q-RM explicitly learns token-level Q-functions from preference data without relying on fine-grained annotations.<n>Reinforcement learning with Q-RM significantly enhances training efficiency, achieving convergence 12 times faster than ORM on GSM8K and 11 times faster than step-level PRM on MATH.
  arXiv  Detail & Related papers  (2025-05-29T11:40:34Z)
• MetaTrading: An Immersion-Aware Model Trading Framework for Vehicular Metaverse Services [94.61039892220037]
  We propose an immersion-aware model trading framework that facilitates data provision for services while ensuring privacy through federated learning (FL)<n>We design an incentive mechanism to incentivize metaverse users (MUs) to contribute high-value models under resource constraints.<n>We develop a fully distributed dynamic reward algorithm based on deep reinforcement learning, without accessing any private information about MUs and other MSPs.
  arXiv  Detail & Related papers  (2024-10-25T16:20:46Z)
• A Step Towards a Universal Method for Modeling and Implementing Cross-Organizational Business Processes [0.0]
  This study lays the groundwork for more accurate and unified business process model executions. It describes the development of a prototype translator that converts specific BPMN elements into a format compatible with PASS. These models are then transformed into source code and executed in a bespoke workflow environment.
  arXiv  Detail & Related papers  (2024-06-18T06:19:44Z)
• Towards Generating Executable Metamorphic Relations Using Large Language Models [46.26208489175692]
  We propose an approach for automatically deriving executable MRs from requirements using large language models (LLMs) To assess the feasibility of our approach, we conducted a questionnaire-based survey in collaboration with Siemens Industry Software.
  arXiv  Detail & Related papers  (2024-01-30T13:52:47Z)
• A higher-order transformation approach to the formalization and analysis of BPMN using graph transformation systems [1.0624606551524207]
  We propose a formalization of the execution semantics of BPMN. Our approach is based on a higher-order transformation from BPMN models to graph transformation systems. To show the capabilities of our approach, we implemented it as an open-source web-based tool.
  arXiv  Detail & Related papers  (2023-11-09T09:55:10Z)
• Semantic Information Marketing in The Metaverse: A Learning-Based Contract Theory Framework [68.8725783112254]
  We address the problem of designing incentive mechanisms by a virtual service provider (VSP) to hire sensing IoT devices to sell their sensing data. Due to the limited bandwidth, we propose to use semantic extraction algorithms to reduce the delivered data by the sensing IoT devices. We propose a novel iterative contract design and use a new variant of multi-agent reinforcement learning (MARL) to solve the modelled multi-dimensional contract problem.
  arXiv  Detail & Related papers  (2023-02-22T15:52:37Z)
• A Contract Theory based Incentive Mechanism for Federated Learning [52.24418084256517]
  Federated learning (FL) serves as a data privacy-preserved machine learning paradigm, and realizes the collaborative model trained by distributed clients. To accomplish an FL task, the task publisher needs to pay financial incentives to the FL server and FL server offloads the task to the contributing FL clients. It is challenging to design proper incentives for the FL clients due to the fact that the task is privately trained by the clients.
  arXiv  Detail & Related papers  (2021-08-12T07:30:42Z)
• Belief Propagation Neural Networks [103.97004780313105]
  We introduce belief propagation neural networks (BPNNs) BPNNs operate on factor graphs and generalize Belief propagation (BP) We show that BPNNs converges 1.7x faster on Ising models while providing tighter bounds. On challenging model counting problems, BPNNs compute estimates 100's of times faster than state-of-the-art handcrafted methods.
  arXiv  Detail & Related papers  (2020-07-01T07:39:51Z)
• Belief Propagation Reloaded: Learning BP-Layers for Labeling Problems [83.98774574197613]
  We take one of the simplest inference methods, a truncated max-product Belief propagation, and add what is necessary to make it a proper component of a deep learning model. This BP-Layer can be used as the final or an intermediate block in convolutional neural networks (CNNs) The model is applicable to a range of dense prediction problems, is well-trainable and provides parameter-efficient and robust solutions in stereo, optical flow and semantic segmentation.
  arXiv  Detail & Related papers  (2020-03-13T13:11:35Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.