Pith. sign in

REVIEW 5 major objections 5 minor 9 references

Supporting Long-term Transactions in Smart Contracts Generated from Business Process Model and Notation (BPMN) Models

T0 review · 5 major / 5 minor · reviewed 2026-08-07 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read This thesis claims BPMN business-process diagrams can be transformed automatically into blockchain smart contracts whose transaction mechanism enforces ACID, access control, and privacy for long-term, possibly nested, trade transactions.

desk verdict A consolidated restatement of the TABS/TABS+ pipeline with a real proof-of-concept, but the inclusive-converging-gateway simplification silently breaks the process semantics that the transactional ACID promise depends on. read the letter →

arxiv 2505.24309 v1 pith:IGYFUFB5 submitted 2025-05-30 cs.SE cs.DC

Christian Gang Liu This is my paper
classification cs.SEcs.DC
keywords BPMNsmartcontractsblockchainlong-termtransactionsnestedACIDtransactionalpropertiessidechainprocessingmodel-drivenengineering
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The thesis tries to establish that a high-level business-process diagram, written in the standard BPMN notation (a graphical standard for describing business processes), can be converted automatically into working blockchain smart contracts without hand-coding the tricky parts. The key added claim over earlier BPMN-to-smart-contract work is that the transformation identifies collaborative trade transactions — the regions where several actors must commit or abort together — and generates a transaction mechanism that gives them database-style ACID guarantees plus access control and privacy, even when transactions are nested inside one another. If correct, this would let business analysts and developers produce long-running multi-party contracts from a diagram, rather than writing transaction logic by hand. The thesis backs the claim with a proof-of-concept tool, TABS+, and evaluations on order processing, supply chain management, and a multi-faceted trade use case.

What carries the argument

The carrying object is the DE-HSM multi-modal model: a hierarchical state machine combined with discrete-event queues to represent concurrency, into which the BPMN diagram is first translated as a directed acyclic graph. The argument then runs on two further constructs. The first is the LSI (Largest Smallest Independent) subgraph, a single-entry/single-exit region of the process graph whose localization property guarantees that computation stays inside the region until it exits; each selected LSI subgraph becomes one smart contract method, and the developer picks which of them are collaborative transactions. The second is pattern augmentation: a preprocessor rewrites the transaction methods to route all ledger reads and writes through a private workspace or cache, inserts begin and end transaction methods, and enforces actor access control, with three hosting options for the cache — a native private data structure, hidden ledger locations, or a slave smart contract on the same chain or on a sidechain. Nested transactions are handled by augmenting the parent method with a two-phase-commit coordinator pattern and each child with a participant pattern.

What would settle it

Feed the TABS+ tool a BPMN diagram containing an irreducible cycle — for instance a negotiation step that sends control back from a later participant to an earlier one, outside any self-contained repeating subprocess — and check whether the tool either refuses to transform it or produces a contract whose execution no longer matches the diagram. Independently, abort a parent transaction after one nested child has answered 'ready' in the two-phase commit, and inspect the ledger: if any child's partial writes survive, the claimed atomicity of nested transactions is refuted.

Watch

Extended reading notes

Core claim

The central claim is that a BPMN model of a collaborative application can be transformed, through an intermediate Discrete Event Hierarchical State Machine (DE-HSM) multi-modal model, into the methods of one or more smart contracts, and that the transformation can be extended so that selected parts of the BPMN graph become collaborative transactions with enforced transactional properties. The thesis defines a Long-term Blockchain (LtB) transaction as a subset of smart contract methods that share a private transaction state and are bracketed by begin and end methods, and a multi-method (mm) transaction as such a subset with an independence property that keeps its effects local. It then argues that the Single-Entry/Single-Exit (SESE) subgraphs of the BPMN graph — refined to Largest Smallest Independent (LSI) subgraphs — are exactly the localized regions that can safely be declared transactions, because control entering such a region cannot leak outside it until it exits. For nested choices, the thesis uses a two-phase commit protocol in which a parent transaction coordinates its child sub-transactions, and it claims the generated mechanisms uphold ACID properties, access control, and privacy on both Ethereum and Hyperledger Fabric, with the option of running selected sub-models on a sidechain.

Load-bearing premise

The load-bearing premise is that the business process can be redrawn with no feedback loops — every cycle must be expressible as a self-contained repeating subprocess — because the discrete-event semantics that carry the transformation are only valid on loop-free graphs.

Editorial extensions

If this is right

  • Writing smart contracts for multi-party, long-running processes reduces to drawing the BPMN diagram and supplying task code, because the transaction scaffolding is generated rather than hand-written.
  • Collaborative transactions defined at the BPMN level can span several actors and outlive many individual blockchain transactions while still behaving atomically.
  • Nested trade transactions commit as a unit: a parent transaction cannot commit unless every child sub-transaction prepares to commit, via the two-phase commit protocol.
  • Selected sub-processes can be pushed to a sidechain to gain privacy or cut cost, with results attested by participants before being written to the mainchain.
  • The same transformation pipeline targets both Ethereum/EVM and Hyperledger Fabric, and it shows the developer the cost and latency trade-off between mainchain-only and sidechain deployment.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A natural next step the thesis leaves implicit: if irreducible feedback loops were mapped to explicit iteration state instead of being excluded, the same DE-HSM pipeline could cover negotiation-heavy trade processes with rework and re-negotiation.
  • The LSI-subgraph decomposition could double as a static analyzer for hand-written smart contracts, since any method extracted from such a subgraph automatically inherits the independence property that multi-method atomicity requires.
  • The 2PC nesting design predicts a testable overhead profile: coordinator events grow linearly with the number of child sub-transactions, so measuring gas per added child on a public testnet would quantify the price of nesting depth.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

5 major / 5 minor

Summary. This manuscript, a PhD thesis submission, proposes an automated transformation pipeline from BPMN business-process models to blockchain smart contracts. The pipeline first converts a BPMN model into a DAG, then into a Discrete Event Hierarchical State Machine (DE-HSM) multi-modal model, and subsequently into smart-contract methods. The central claim is that this transformation can support long-term collaborative trade transactions, including nested transactions, with ACID properties, access control, and privacy. The authors introduce two concepts: Long-term Blockchain (LtB) transactions and multi-method (mm) transactions, enforced via pattern augmentation and private workspaces. Nested collaborative transactions are supported using a 2-phase-commit protocol. A proof-of-concept tool, TABS+, is described and evaluated on three self-chosen use cases (order processing, supply chain management, and a multi-faceted trade case) on Ethereum and Hyperledger Fabric, including sidechain processing for cost and privacy. The thesis also reports latency and gas cost measurements, though without raw data. The manuscript is largely a consolidation of the author's prior publications and relies on the author's master's thesis for key proofs.

Significance. If the central claims are substantiated, the work would be a meaningful step toward model-driven engineering of smart contracts for multi-party, long-running business processes. The paper's conceptual contributions are the definition of LtB and mm transactions, the use of SESE/LSI subgraphs to identify transaction boundaries, and the systematic transformation via DE-HSM models. The proof-of-concept TABS+ tool demonstrates an end-to-end pipeline, which is a notable engineering effort. However, the paper's validity rests on several assumptions and simplifications that are explicitly acknowledged but not resolved, and the evaluation is not sufficiently independent or detailed to establish the claimed level of coverage and feasibility. The work is best viewed as a promising proposal that needs further formalization and broader empirical validation.

major comments (5)
  1. [§4.1.1, Fig. 4.1, Table 1.1]
  2. [§4.1.3.1, §4.1.1]
  3. [§4.1.3.4, Theorem 1]
  4. [§6.3, §6.4, Tables 6.1-6.4]
  5. [§4.1.3.3, §6.1]
minor comments (5)
  1. [§4.1.1]
  2. [Fig. 5.4 caption]
  3. [§4.1.3.4]
  4. [§2.6]
  5. [§6.1]

Circularity Check

0 steps flagged · score 2.0 of 10

No circular derivation chain: the BPMN-to-smart-contract transformation is an implemented construction, and the self-citations used for ACID and graph-theory results are to prior, independent papers rather than to the conclusion of this thesis.

full rationale

No place in the thesis was found where a claimed prediction is algebraically identical to a fitted input or where a first-principles result is defined in terms of the target conclusion. The central contribution is an implemented transformation tool (TABS+) demonstrated on three use cases, with latency and cost measurements; those are engineering evaluations, not predictions forced by a fitted parameter. The definitions of LtB and mm transactions are stipulated requirements, and the SESE-subgraph selection is a design choice: the thesis proposes that collaborative transactions be localized and then builds mechanisms for that construct, which is a modeling decision rather than a circular reduction. The proof of Theorem 1 is deferred to the author's earlier work (Liu, 2021), and the ACID-support claim for the mm-transaction cache options is cited to (Liu et al., 2023a); both are same-author prior publications, but they are parameter-free and do not assume the present thesis's BPMN-transformation conclusion, so they function as ordinary citations rather than self-referential support. The cost tables adopted from prior papers are self-benchmarking but are not fitted outputs renamed as predictions. The explicitly disclosed assumptions about loop elimination and the inclusive converging gateway simplification are scope and correctness limitations, not circularity. Overall, the manuscript contains minor self-citation that is not load-bearing, hence a score of 2.

Assumptions & free parameters 0 free parameters · 6 assumptions · 4 invented entities

The thesis builds on conceptual constructs and methods defined in the authors' prior work rather than on independently established entities. The main assumptions are about BPMN model restrictions and standard protocol correctness. No numeric free parameters are fitted to data; the developer selects subgraphs and sidechain placement as design choices.

assumptions (6)
  • ad hoc to paper BPMN model is acyclic after loop elimination; loops are represented by looping subprocesses.
    Section 4.1.1 imposes this assumption to ensure model determinism and to enable DE-HSM zero-delay semantics.
  • domain assumption Zero-delay DE-HSM semantics from Yannakakis (2000) apply, requiring no feedback loops.
    Section 4.1.3.1 adopts zero-delay semantics and a single global queue; loops would break termination guarantees.
  • domain assumption Task code must be supplied by the developer; the transformation generates only method skeletons.
    Section 4.1.1 states that the developer provides scripts for each BPMN task, following standard BPMN-to-code practice.
  • domain assumption SESE subgraphs have the localization property: execution stays inside until the exit node.
    Section 4.2.2 relies on this property to argue that transaction effects are contained, making atomicity enforceable.
  • standard math The two-phase commit protocol guarantees atomicity of nested transactions.
    Section 5.1 uses 2PC with coordinator and participant patterns; 2PC correctness is assumed from distributed systems literature (Gray & Lamport, 2006).
  • standard math Theorem 1 on independent subgraphs is taken from Liu (2021) without proof in this thesis.
    Section 4.1.3.4 cites the proof to pages 39-41 of the author's master's thesis, rather than presenting it.
invented entities (4)
  • LtB transaction (long-term blockchain transaction)
    purpose: Defines a multi-method transaction spanning multiple smart contract method executions, with begin/end methods and shared transaction state.
    Introduced as a definition in Section 3.2, with no external falsifiable prediction.
  • Multi-method (mm) transaction with private workspace
    purpose: Provides deferred writes to the ledger through a cache, supporting atomicity and isolation for transactions spanning methods.
    Concept presented in Section 3.3; the private workspace is an implementation construct, not independently verified.
  • DE-HSM multi-modal model
    purpose: Intermediate representation combining discrete events and hierarchical state machines to bridge BPMN and smart contract methods.
    Modeling formalism used throughout Chapter 4; its efficacy is only assessed through the authors' own tool.
  • Pattern augmentation technique
    purpose: Automatically amends smart contract methods with transaction patterns for begin, end, cache, and 2PC behavior.
    Procedural technique described in Section 3.3 and Chapter 5, demonstrated only in the authors' PoC.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Supporting Long-term Transactions in Smart Contracts Generated from Business Process Model and Notation (BPMN) Models." pith.science (2026). https://pith.science/paper/IGYFUFB5

@misc{pith2026250524309,
  author       = {Pith},
  title        = {Pith review of: Supporting Long-term Transactions in Smart Contracts Generated from Business Process Model and Notation (BPMN) Models},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/IGYFUFB5}},
  note         = {Machine review of arXiv:2505.24309}
}
read the original abstract

To alleviate difficulties in writing smart contracts for distributed blockchain applications, as other research, we propose transformation of Business Process Model and Notation (BPMN) models into blockchain smart contracts. Unlike other research, we use Discrete Event Hierarchical State Machine (DE-HSM) multi-modal modeling to identify collaborative trade transactions that need to be supported by the smart contract and describe how the trade transactions, that may be nested, are supported by a transaction mechanism. We describe algorithms to (i) identify the nested trade transactions and to (ii) transform the BPMN model into blockchains smart contracts that include a transaction mechanism to enforce the transactional properties for the identified trade transactions. 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. The thesis examines and evaluates automatically generated alternative transaction mechanisms to support such transactions using three use cases of varying degree of complexity, namely order processing, supply chain management, and a multi-faceted trade use case. The research enriches the academic dialogue on blockchain technology and smart contracts and proposes potential avenues for future research.

Figures

Figures reproduced from arXiv: 2505.24309 by the authors.

Figure 2
Figure 2. [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗
Figure 5
Figure 5. [PITH_FULL_IMAGE:figures/full_fig_p006_5.png] view at source ↗
Figure 6
Figure 6. [PITH_FULL_IMAGE:figures/full_fig_p006_6.png] view at source ↗
Figures from the paper (30 more)
Figure 2
Figure 2. Figure 2 [PITH_FULL_IMAGE:figures/full_fig_p027_2.png]
Figure 4
Figure 4. Figure 4 [PITH_FULL_IMAGE:figures/full_fig_p044_4.png]
Figure 4
Figure 4. Figure 4 [PITH_FULL_IMAGE:figures/full_fig_p046_4.png]
Figure 4
Figure 4. Figure 4 [PITH_FULL_IMAGE:figures/full_fig_p052_4.png]
Figure 4
Figure 4. Figure 4 [PITH_FULL_IMAGE:figures/full_fig_p061_4.png]
Figure 4
Figure 4. Figure 4 [PITH_FULL_IMAGE:figures/full_fig_p065_4.png]
Figure 4
Figure 4. Figure 4 [PITH_FULL_IMAGE:figures/full_fig_p069_4.png]
Figure 4
Figure 4. Figure 4 [PITH_FULL_IMAGE:figures/full_fig_p070_4.png]
Figure 4
Figure 4. Figure 4 [PITH_FULL_IMAGE:figures/full_fig_p072_4.png]
Figure 4
Figure 4. Figure 4 [PITH_FULL_IMAGE:figures/full_fig_p073_4.png]
Figure 4
Figure 4. Figure 4 [PITH_FULL_IMAGE:figures/full_fig_p078_4.png]
Figure 4
Figure 4. Figure 4 [PITH_FULL_IMAGE:figures/full_fig_p085_4.png]
Figure 5
Figure 5. Figure 5 [PITH_FULL_IMAGE:figures/full_fig_p091_5.png]
Figure 5
Figure 5. Figure 5 [PITH_FULL_IMAGE:figures/full_fig_p092_5.png]
Figure 5
Figure 5. Figure 5 [PITH_FULL_IMAGE:figures/full_fig_p093_5.png]
Figure 5
Figure 5. Figure 5 [PITH_FULL_IMAGE:figures/full_fig_p094_5.png]
Figure 6
Figure 6. Figure 6 [PITH_FULL_IMAGE:figures/full_fig_p097_6.png]
Figure 6
Figure 6. Figure 6 [PITH_FULL_IMAGE:figures/full_fig_p099_6.png]
Figure 6
Figure 6. Figure 6 [PITH_FULL_IMAGE:figures/full_fig_p101_6.png]
Figure 6
Figure 6. Figure 6 [PITH_FULL_IMAGE:figures/full_fig_p104_6.png]
Figure 6
Figure 6. Figure 6 [PITH_FULL_IMAGE:figures/full_fig_p105_6.png]
Figure 6
Figure 6. Figure 6 [PITH_FULL_IMAGE:figures/full_fig_p107_6.png]
Figure 6
Figure 6. Figure 6 [PITH_FULL_IMAGE:figures/full_fig_p108_6.png]
Figure 6
Figure 6. Figure 6 [PITH_FULL_IMAGE:figures/full_fig_p111_6.png]
Figure 6
Figure 6. Figure 6 [PITH_FULL_IMAGE:figures/full_fig_p113_6.png]
Figure 6
Figure 6. Figure 6 [PITH_FULL_IMAGE:figures/full_fig_p115_6.png]
Figure 6
Figure 6. Figure 6 [PITH_FULL_IMAGE:figures/full_fig_p116_6.png]
Figure 6
Figure 6. Figure 6 [PITH_FULL_IMAGE:figures/full_fig_p117_6.png]
Figure 6
Figure 6. Figure 6 [PITH_FULL_IMAGE:figures/full_fig_p119_6.png]
Figure 6
Figure 6. Figure 6 [PITH_FULL_IMAGE:figures/full_fig_p120_6.png]

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

9 extracted references · 4 canonical work pages

  1. [1]

    Using FSMs to Find Patterns for Off-Chain Computing: Finding Patterns for Off-Chain Computing with FSMs In: Bodorik, P., Liu, C., Jutla, D

    Proceedings ACM ICBCT 2021: Bodorik, P ., Liu, C., Jutla, D. Using FSMs to Find Patterns for Off-Chain Computing: Finding Patterns for Off-Chain Computing with FSMs In: Bodorik, P., Liu, C., Jutla, D. (2021). Using FSMs to Find Patterns for Off-Chain Computing: Finding Patterns for Off-Chain Computing with FSMs. In 2021 The 3rd International Conference on...

    arXiv 2021

  2. [2]

    A Tool for Moving Blockchain Computations Off-Chain In: Liu, C., Bodorik, P., Jutla, D

    Proceedings ACM BSCI 2021: Liu, C., Bodorik, P ., Jutla, D. A Tool for Moving Blockchain Computations Off-Chain In: Liu, C., Bodorik, P., Jutla, D. (2021). A Tool for Moving Blockchain Computations Off-Chain. In Proceedings of 2021 3rd ACM International Symposium on Blockchain and Secure Critical Infrastructure (BSCI'21), June 3-7, 2021. ACM, New York, NY...

    arXiv 2021

  3. [3]

    Automating Smart Contract Generation on Blockchains Using Multi-Modal Modeling In: Liu, C., Bodorik, P., Jutla, D

    Journal of Advances in Information Technology (JAIT) 2021: Liu, C., Bodorik, P ., Jutla, D. Automating Smart Contract Generation on Blockchains Using Multi-Modal Modeling In: Liu, C., Bodorik, P., Jutla, D. (2021). Automating Smart Contract Generation on Blockchains Using Multi-modal Modeling. Journal of Advances in Information Technology (JAIT). 10.12720...

    work page doi:10.12720/jait 2021

  4. [4]

    From BPMN to Smart Contracts on Blockchains: Transforming BPMN to DE-FSM Multi-Modal Model In: Liu, C., Bodorik, P., Jutla, D

    Proceedings IEEE ICEET 2021: Liu, C., Bodorik, P ., Jutla, D. From BPMN to Smart Contracts on Blockchains: Transforming BPMN to DE-FSM Multi-Modal Model In: Liu, C., Bodorik, P., Jutla, D. (2021). From BPMN to smart contracts on blockchains: Transforming BPMN to DE-HSM multi-modal model. 2021 IEEE International Conference on Engineering and Emerging Techn...

    arXiv 2021

  5. [5]

    Supporting Long-Term Transactions in Smart Contracts In: Liu, C., Bodorik, P., Jutla, D

    Proceedings IEEE BCCA 2022: Liu, C., Bodorik, P ., Jutla, D. Supporting Long-Term Transactions in Smart Contracts In: Liu, C., Bodorik, P., Jutla, D. (2022). Supporting Long-term Transactions in Smart Contracts. 2022 IEEE Fourth International Conference on Blockchain Computing and Applications (BCCA), 11–19. https://doi.org/10.1109/BCCA55292.2022.9922193 133

    arXiv 2022

  6. [6]

    Patent Application Submission USPTO 2022: Bodorik, P ., Liu, C., Jutla, D. System and Methods for Automated Generation of Smart Contracts from BPMN Models Using DE-HSM Multi-Modal Models Executed by Smart Contracts with Sidechain Processing In: Bodorik, P., Liu, C., Jutla, D. (2022). System and Methods for Automated Generation of Smart Contracts from BPMN...

    work page 2022

  7. [7]

    TABS: Transforming Automatically BPMN Models into Blockchain Smart Contracts In: Bodorik, P., Liu, C., Jutla, D

    ELSEVIER Journal Blockchain: Research and Applications (BCRA) 2023: Bodorik, P ., Liu, C., Jutla, D. TABS: Transforming Automatically BPMN Models into Blockchain Smart Contracts In: Bodorik, P., Liu, C., Jutla, D. (2023). TABS: Transforming automatically BPMN models into blockchain smart contracts. Blockchain: Research and Applications (Elsevier), 100115....

    arXiv 2023

  8. [8]

    G., Bodorik, P ., Jutla, D

    Proceedings SPRINGER BLOCKSYS 2023: Liu, C. G., Bodorik, P ., Jutla, D. Long-Term Blockchain Transactions Spanning Multiplicity of Smart Contract Methods In: Liu, C. G., Bodorik, P., Jutla, D. (2023). Long-Term Blockchain Transactions Spanning Multiplicity of Smart Contract Methods. In Springer BlockSys: Blockchain and Trustworthy Systems. https://doi.org...

    work page doi:10.1007/978-981-99-8104-5 2023

Show all 9 references
  1. [9]

    TABS+: Transforming Automatically BPMN Models to Smart Contracts with Nested Collaborative Transactions In: Liu, C., Bodorik, P., Jutla, D

    Submitted Manuscript (Under Review) ACM DLT 2023: Liu, C., Bodorik, P ., Jutla, D. TABS+: Transforming Automatically BPMN Models to Smart Contracts with Nested Collaborative Transactions In: Liu, C., Bodorik, P., Jutla, D. (2023). Tabs+: Transforming Automatically BPMN Models ...

    2023

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.