<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>DLT</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Block-Timer: A Layer-Optimized Approach for BPMN Process Execution with Time Constraints on Blockchain</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Matteo Vaccargiu</string-name>
          <email>matteo.vaccargiu@unica.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Endri Xhina</string-name>
          <email>endri.xhina@fshn.edu.al</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Roberto Tonelli</string-name>
          <email>roberto.tonelli@unica.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Mathematics and Computer Science, University of Cagliari</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Department of Mathematics and Computer Science, University of Tirana</institution>
          ,
          <country country="AL">Albania</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>International School of Advanced Studies, University of Camerino</institution>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2025</year>
      </pub-date>
      <volume>7</volume>
      <fpage>12</fpage>
      <lpage>14</lpage>
      <abstract>
        <p>This paper presents Block-Timer, a layer-optimized approach for executing BPMN processes with time constraints on blockchain networks. Time-bound activities are core components of business processes, representing regulatory deadlines and service level agreements. While blockchain technology ofers transparency and trustless coordination for process execution, implementing time constraints on blockchain presents significant technical challenges. Traditional blockchain platforms rely on vulnerable block timestamps, while executing complex processes entirely on Layer 1 faces economic and throughput limitations. We propose a conceptual hybridsolution where a block-number-based implementation of timer events ensures secure, manipulation-resistant, time tracking without external dependencies. Our solution automatically translates BPMN processes with timer events into executable smart contracts, with a comparative analysis of execution costs between Ethereum (Layer 1) and Arbitrum (Layer 2) across three diverse case studies. The analysis reveals that Layer 2 implementation reduces operational costs compared to Layer 1 while maintaining functional equivalence. Based on these findings, we propose an hybrid architecture that strategically distributes process operations between layers according to security requirements and cost considerations. This approach optimizes the balance between security guarantees and economic feasibility for blockchain-based business process execution, particularly for multi-party workflows requiring both trust and eficiency. Our security analysis confirms the integrity of the block-based timer implementation with no critical vulnerabilities, demonstrating a conceptual solution for time-constrained process execution on blockchain networks.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;BPMN</kwd>
        <kwd>Timer Events</kwd>
        <kwd>Blockchain</kwd>
        <kwd>Layer 1</kwd>
        <kwd>Layer 2</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Business Process Model and Notation (BPMN) has emerged as the standard for modeling organizational
workflows, providing a graphical representation that bridges the gap between process design and
implementation [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. In today’s business environment, time constraints are fundamental components
of these processes, often manifested as regulatory deadlines, service level agreements, or operational
timeframes. These time-bound activities are represented in BPMN as timer events, which trigger specific
actions after predetermined periods or at scheduled timestamps.
      </p>
      <p>
        Meanwhile, blockchain technology ofers important capabilities for business process execution
through immutable record-keeping, transparent operations, and trustless coordination between
participants [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. The integration of BPMN with blockchain technology creates new opportunities for
automated, transparent, and verifiable process execution, particularly for multi-party workflows where
trust and accountability are essential.
      </p>
      <p>
        However, implementing time constraints on blockchain presents significant technical challenges
[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. Traditional blockchain platforms like Ethereum rely on block timestamps, which are vulnerable to
manipulation by miners within certain bounds. Additionally, executing complex business processes
entirely on Layer 1 blockchains faces practical limitations due to high transaction fees that make
frequent operations economically unfeasible, especially during network congestion periods. Layer 1
blockchains also have inherent throughput limitations that restrict their ability to handle high-volume
process execution, while block confirmation times can impact the timing precision required for critical
business processes [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
      </p>
      <p>
        While Layer 2 scaling solutions like Arbitrum significantly reduce transaction costs through optimistic
rollups, they introduce diferent security assumptions such as delayed finality through fraud-proof
mechanisms rather than immediate consensus, and potential vulnerability to validator collusion [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
These diferences may not be appropriate for all operations within a business process, especially
those requiring immediate finality or maximum decentralization. This creates a contrast between cost
eficiency and security guarantees that must be balanced according to process requirements.
      </p>
      <p>This paper presents an approach that addresses these challenges through a block-number-based
implementation of timer events that ensures secure, manipulation-resistant time tracking without
relying on external time services. We automatically translate BPMN processes with timer events
into secure, executable Solidity smart contracts, along with a comparative analysis of execution costs
between Ethereum (Layer 1) and Arbitrum (Layer 2) across three diverse case studies. From this analysis,
we propose a conceptual hybrid architecture that strategically distributes process operations between
Layer 1 and Layer 2 based on security requirements and cost considerations.</p>
      <p>Our approach was validated through the implementation of three diferent BPMN case studies: a
municipal document request process, an insurance policy application workflow, and an academic
examination process. Each case demonstrates diferent patterns of timer event usage and inter-participant
coordination. We provide a complete replication package including all the case study BPMN codes, the
Java code of the automatic translator and the translated three smart contracts at this link to support
reproducibility and verification.</p>
      <p>The remainder of this paper is organized as follows: Section 2 provides background on blockchain
time mechanisms and BPMN integration approaches. Section 3 details our methodology for block-based
timer implementation and smart contract generation. Section 4 presents the implementation results and
cost analysis across diferent blockchain layers. Section 5 introduces our proposed hybrid architecture.
Section 6 discusses assumptions and threats of our study and section 7 implications, limitations, and
concludes with future research directions.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Background and Related Work</title>
      <sec id="sec-2-1">
        <title>2.1. Blockchain-Based Business Process Execution</title>
        <p>
          Blockchain technology has emerged as a support for collaborative business processes among mutually
untrusting parties in decentralized environments. Recent research has developed several model-driven
approaches to implement business processes on blockchain platforms using standardized process
modeling notations, particularly BPMN. Di Ciccio et al. [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ] present the foundational principles of
blockchain support for collaborative business processes, highlighting how blockchain’s tamper-proof
ledger can capture process history and current state while smart contracts can encode business logic
and enforce process rules. The authors note that blockchain enables trustworthy process execution
among partially trustable parties without requiring centralized coordinators, making it ideal for
interorganizational processes. They introduce two primary architectural approaches: using blockchain as a
message exchange mechanism for choreographies, and deploying entire collaborative processes
onchain. Nousias et al. [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ] address the challenges of developing and deploying Decentralized Applications
(DApps) on blockchain networks by standardizing and modeling these processes through BPMN.
Their approach begins with a Decision Model and Notation (DMN) decision model to help developers
determine if a DApp is justified for their use case, followed by two detailed BPMN models: one for DApp
development and another for DApp deployment. These models serve as a roadmap to enhance
decisionmaking, facilitate developer communication, and reduce implementation time and cost. The authors
demonstrate the practical application of their models by implementing a DApp for registering and
verifying academic qualifications, illustrating how BPMN can be a powerful tool for systematic DApp
development. Other two key implementation frameworks for blockchain-based processes are: Lorikeet
and Caterpillar. Lorikeet [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ], developed by Data61, is a model-driven engineering tool for blockchain
application development focusing on business processes and asset control. It generates Solidity smart
contracts from BPMN models and asset data schemas, allowing code review and adaptation before
deployment. Lorikeet extends BPMN with registry references and action invocations to interact with
on-chain asset data stores, making it particularly suitable for processes involving asset management.
Caterpillar, presented by López-Pintado et al.[
          <xref ref-type="bibr" rid="ref9">9</xref>
          ], takes a diferent approach by implementing the
process execution logic entirely on-chain. It translates BPMN models into smart contracts that enforce
business process rules and maintain process state on the blockchain. Caterpillar follows three design
principles: modeling collaborative processes as if all parties shared the same execution infrastructure,
storing complete process state and metadata on-chain, and enabling process execution to proceed
even if of-chain components are unavailable. This approach provides stronger guarantees of process
compliance but with higher on-chain storage costs. Corradini et al. [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] present an approach for
modeling and executing BPMN choreographies with multiple instances on blockchain technology.
The authors address the limitation of existing blockchain-based choreography implementations that
typically focus on single-instance scenarios, which restricts their application in complex systems like IoT
where multiple devices perform similar operations. Their solution introduces support for multi-instance
participants and tasks in BPMN choreography diagrams, with clear semantics and implementation in
smart contracts. The framework includes modeling capabilities for specifying multiplicity attributes,
automatic translation of the models into Solidity code, and execution on blockchain platforms. To
demonstrate feasibility, the authors implemented a Smart Thermostat case study on the Polygon
blockchain, where a thermostat coordinates with multiple sensors and radiators. Their cost analysis
showed the approach is practical in terms of blockchain transaction fees, particularly when using Layer
2 solutions like Polygon rather than Ethereum mainnet. The same authors propose in [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ] a flexible
approach that decouples process logic (stored of-chain in IPFS as Drools rules) from execution state
(stored on-chain), enabling run-time modifications without compromising blockchain’s trustworthiness
properties. Their FlexChain framework supports voting mechanisms to ensure agreement on process
changes, addressing the challenge of reconciling blockchain’s immutability with the need for business
process flexibility. A common challenge across these approaches is balancing on-chain and of-chain data
and computation. On-chain execution ensures integrity and transparency but incurs higher costs and
scalability limitations, while of-chain processing is more eficient but potentially less secure. Researchers
are actively addressing these trade-ofs through hybrid architectures that optimize process execution
while maintaining essential trust guarantees. These implementations demonstrate the feasibility of
using blockchain as a foundation for trustworthy, transparent execution of collaborative business
processes, while continuing research focuses on improving flexibility, scalability, and cost-efectiveness
of blockchain-based process execution environments.
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Time Constraints in Blockchain Systems</title>
        <p>
          Time management is a challenge in blockchain-based systems due to the decentralized and
asynchronous nature of blockchain networks. Several approaches have been proposed to address these
points. Eichinger and Ebermann [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] investigate the efectiveness of smart contracts in stipulating
time constraints. They define "execution accuracy" as the probability that a smart contract execution
yields the same result based on world time and injected time. Their experiments on local blockchain
implementations (Ganache and Quorum) and public Ethereum test networks (Görli and Rinkeby) show
that execution accuracy decreases near interval bounds. They identify two primary methods for
implementing time constraints: the "block timestamp method", which uses timestamps set by miners,
and the "parameter method", where transaction senders attach timestamps to transactions. Ladleif and
Weske [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] present an analysis of temporal constraints in blockchain-based process execution. They
identify five distinct time measures available in blockchain environments: block timestamp, block
number, parameter, storage oracle, and request-response oracle. Each measure has diferent
characteristics regarding accuracy, trust assumptions, immediacy, cost, and reliability. Their work indicates
that while absolute and relative temporal constraints can be implemented in blockchain, they require
careful consideration of the underlying time measure used. For more complex time-based applications,
Chae et al. [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ] propose a "time-release blockchain" that integrates time-release cryptography with
blockchain’s proof-of-work mechanism. Their approach automatically adjusts for changes in network
computing power over time and eliminates the need for trusted third parties in time-release applications.
This enables practical implementation of systems where information must remain encrypted until a
predetermined future time, with applications in areas such as electronic voting and sealed-bid auctions.
These approaches demonstrate that while implementing time constraints in blockchain systems remains
challenging, multiple viable methods exist with diferent trade-ofs in terms of accuracy, security, and
eficiency. The choice of approach depends on the specific requirements of the application and the
characteristics of the underlying blockchain platform.
        </p>
      </sec>
      <sec id="sec-2-3">
        <title>2.3. Operation Classification for Multi-Layer Execution</title>
        <p>Several research eforts have explored the use of blockchain in multi-party processes, each contributing
complementary insights into how operations can be classified and distributed across architectural layers
for decentralized execution.</p>
        <p>
          Argento et al. [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ] introduce ID-Service, a blockchain-based accountability platform for
crossorganizational workflows (COWs). The architecture relies on a two-module division: the Accountability
Certification layer integrates identity management via eIDAS-compliant digital identities, while the
Accountability Workflow layer handles the orchestration of inter-organizational processes using smart
contracts. Each operational action is anchored to an authenticated identity and recorded immutably,
enforcing non-repudiation. Notably, the synchronization points in workflows are modeled as critical
transitions between actors, preserving causal ordering and traceability. This layered architecture
efectively separates the tasks of identity anchoring and process execution, laying the groundwork for
classifying blockchain operations according to system responsibility and trust boundaries.
        </p>
        <p>
          A complementary perspective is proposed by Alfarisy [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ], which addresses data collection and
validation in a resource governance scenario. Here, a service-oriented architecture is used to develop
an IoT-integrated blockchain platform for fishing quota enforcement. The system architecture spans
four layers—device, network, service, and application—each abstracting a specific operational domain.
Transactional data such as timestamps and fish weights are recorded via IoT devices and pushed through
the service layers to the blockchain. The study provides quantitative assessments of cohesion, coupling,
and reusability, showing that well-separated services with low interdependency are preferable for
repeatability and maintainability. These principles validate the need for classifying operations based on
abstraction and coordination layer, particularly in high-volume data acquisition scenarios.
        </p>
        <p>
          Further abstraction is explored by Pirani et al. [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ], where blockchain is embedded into a
cybersystemic methodology for governing hybrid reality (HyR) phenomena. Rather than focusing on
domainspecific implementations, the paper proposes a formal framework that positions blockchain as a systemic
trust infrastructure. The authors present a cybernetic modeling approach grounded in system dynamics
and Ashby’s Law of Requisite Variety, in which blockchain acts as a regulatory mechanism enforcing
control loops between human and machine agents. The operations here are not merely
transactionlevel interactions, but control-oriented interventions across dynamically defined roles and states. This
systemic framing introduces a new axis of operation classification—governance and adaptation—which
complements traditional task-level distinctions.
        </p>
        <p>
          Finally, the work in [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ] presents a visual, reuse-oriented code generator for smart contracts, based
on BPMN models. Their generator employs a multi-layer library that separates generic logic,
domainspecific functions, and composable workflow templates. Each layer corresponds to diferent granularity
and specialization of contract logic, enabling domain experts to reuse tested modules without extensive
programming knowledge. Code generation, compilation, and deployment are integrated in a single
toolchain, streamlining smart contract creation for multi-party interactions. This approach highlights
the value of classifying blockchain operations by reusability and modularity, with particular emphasis
on how diferent layers facilitate eficient development and clearer separation of concerns.
        </p>
        <p>Together, these studies afirm the importance of categorizing blockchain-enabled operations not
only by their functional scope, but also by their positioning across trust, orchestration, and abstraction
layers. This classification is important for enabling scalable and maintainable process execution in
decentralized environments.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Methodology</title>
      <p>Our research methodology combines BPMN process modeling with blockchain implementation on
both Layer 1 and Layer 2 networks, focusing on secure and eficient timer event handling. This section
details our approach to process modeling, smart contract generation, security verification, and cost
analysis.</p>
      <sec id="sec-3-1">
        <title>3.1. BPMN Process Modeling</title>
        <p>We created three representative BPMN collaboration diagrams using Camunda Modeler, each featuring
diferent timer event patterns and multi-participant interactions. The first case study is a
citizenmunicipality interaction for a document request process with 30-day and 15-day processing deadlines.
The second one is a policyholder-insurer application workflow with 5-day and 7-day decision deadlines.
The third application is a three-party (professor-student-secretary) workflow with 15-day evaluation
and 7-day decision deadlines. Each process was designed to capture common time-constrained business
scenarios while providing suficient complexity to validate our approach across various timer patterns
and participant configurations.</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Smart Contract Generation</title>
        <p>We developed an automated BPMN-to-Solidity transformation tool that generates blockchain-executable
smart contracts from BPMN diagrams. Our transformation approach employs a block-based timer
implementation. Rather than using timestamp-based mechanisms, our approach converts ISO duration
formats (e.g., "P30D" for 30 days) into block numbers. According to Ethereum network statistics 1, since
October 2022, the daily average block time has maintained a consistent 12-second interval, providing
a stable foundation for our time calculations. This stability allows us to reliably estimate that one
day corresponds to approximately 7200 blocks (24 hours * 3600 seconds / 12 seconds per block). This
conversion uses the formula:
blockEstimate = days * 7200
blocks
day</p>
        <p>Arbitrum does not maintain a fixed block time like Ethereum. However, according to Ofchain Labs,
the average latency of Arbitrum One blocks is around 250 milliseconds 2 3.</p>
        <p>This approach provides resistance to miner manipulation of timestamps, a deterministic execution
without relying on external time oracles, and a consistent timing across network conditions.</p>
        <p>The generated contracts implement a state machine that tracks each BPMN element’s lifecycle
through three states: DISABLED, ENABLED, and DONE. Element dependencies are enforced through
state checks, ensuring process integrity.</p>
        <p>Moreover, each function includes participant validation based on Ethereum addresses mapped to
BPMN participants, ensuring that only authorized participants can execute their designated tasks.</p>
        <p>Finally the generated contracts incorporate OpenZeppelin’s security patterns, including
ReentrancyGuard, Ownable, and Pausable, providing protection against common attack vectors and administrative
control mechanisms.</p>
        <sec id="sec-3-2-1">
          <title>1https://etherscan.io/chart/blocktime 2https://research.arbitrum.io/t/the-power-of-faster-blocks/9609 3https://arbiscan.io/blocks</title>
        </sec>
      </sec>
      <sec id="sec-3-3">
        <title>3.3. Security Analysis</title>
        <p>We implemented a two-stage security verification process. First, each generated contract underwent
automated vulnerability detection using Slither [18], a static analysis framework that identifies common
smart contract vulnerabilities including reentrancy, integer overflow/underflow, and access control
issues. Then we supplemented the Slither analysis with custom checks specifically designed for
timerbased operations, including verification of proper access controls for timer functions, analysis of block
number manipulation risks, assessment of dependency enforcement mechanisms and validation of
participant address handling.</p>
        <p>These security measures ensured that the generated contracts maintained process integrity while
addressing blockchain-specific vulnerabilities. All contracts passed both the Slither analysis and our
custom security checks with zero critical vulnerabilities detected.</p>
      </sec>
      <sec id="sec-3-4">
        <title>3.4. Deployment and Cost Analysis</title>
        <p>We deployed each smart contract on both Ethereum Sepolia Testnet (Layer 1) and Arbitrum Sepolia Testnet
(Layer 2) using Remix IDE and MetaMask. For each contract, we executed the complete process flow,
recording gas consumption for every operation. To provide a realistic cost assessment, we collected daily
gas price data from Etherscan4 and Arbiscan5, along with cryptocurrency price data from CoinGecko67,
over a one-month period (March 14 - April 13, 2025). We then calculated median gas price and the
median cryptocurrency price and the standard deviation. We found for Ethereum 0.6350 ± 1.1438 Gwei
and $1,887.76 ± 167.64, instead for Arbitrum 0.0174 ± 0.1042 Gwei and $0.33397 ± 0.03893.</p>
        <p>This methodology provides a robust cost estimation that accounts for market fluctuations while
avoiding outlier-driven distortions. By using median values rather than means, we established a realistic
operational cost baseline for blockchain-based process execution across diferent layers.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Implementation and Results</title>
      <p>This section presents our implementation of three case studies and the comparative cost analysis
between Layer 1 and Layer 2 blockchain networks. The BPMN codes of the case studies, the Java code
of the automatic translator and the translated three smart contracts are available at this link.</p>
      <sec id="sec-4-1">
        <title>4.1. Case Study Implementation</title>
        <p>We implemented three distinct BPMN processes, each selected to represent diferent timer event patterns
and multi-participant scenarios common in real-world applications.</p>
        <p>The first case study in Figure 1 implements a municipal document request process between a citizen
and municipality. This process includes a 30-day primary processing window and a 15-day extension
period when additional processing time is needed. The workflow begins with a completeness check that
creates an initial decision point, followed by document processing with enforced regulatory deadlines.
This case study demonstrates how timer events ensure compliance with administrative procedures and
service level agreements.</p>
        <p>The second case study in Figure 2 models an insurance policy application process between a
policyholder and an insurance company. This workflow includes two timer events: a 7-day proposal
deadline for the insurance company to prepare a policy proposal and a 5-day decision deadline for
the policyholder to sign the policy. The process includes decision points that create alternative paths
depending on the completeness of the application and the policyholder’s acceptance decision. This case
study demonstrates timer events that govern both organizational and customer-facing deadlines.</p>
        <sec id="sec-4-1-1">
          <title>4https://etherscan.io/gasTracker#chart_gasprice 5https://arbiscan.io/chart/gasprice 6https://www.coingecko.com/it/monete/ethereum/historical_data?start=2025-03-13&amp;end=2025-04-12 7https://www.coingecko.com/en/coins/arbitrum/historical_data?start=2025-03-12&amp;end=2025-04-14</title>
          <p>Finally, the third case study in Figure 3 represents an academic examination process involving three
participants: professor, student, and secretary. This complex workflow features multiple timer events,
including a 7-day registration period, a 15-day deadline for professors to evaluate exams, and a 7-day
deadline for students to accept or reject their grades. The process also includes an auto-acceptance
mechanism if no decision is made within the specified timeframe. This case study demonstrates how
timer events can coordinate activities among multiple participants with interdependent responsibilities.</p>
          <p>Each BPMN model was transformed into a Solidity smart contract using our automated conversion
tool. The transformation process preserved the timer event semantics by implementing them as
blocknumber-based mechanisms rather than traditional timestamp approaches. The generated smart contracts
included security features from OpenZeppelin, participant role management, and comprehensive audit
logging to track process execution.</p>
        </sec>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Deployment and Gas Analysis</title>
        <p>We deployed each smart contract on both Ethereum Sepolia Testnet (Layer 1) and Arbitrum Sepolia
Testnet (Layer 2) to analyze performance and cost diferences.</p>
        <p>Function/Action Gas Used ETH Cost (USD) ARB Cost (USD)
Contract Creation</p>
        <p>startEvent()
sendRequestToMunicipality()</p>
        <p>receiveRequest()
gatewayAction("CheckRequest")</p>
        <p>elaborateRequest()
f30DaysDeadlineForDocumentDelivery()
gatewayAction("CheckDocuments")</p>
        <p>sendDocuments()
documentsReceived()
sendFeedback()</p>
        <p>Similar patterns emerged in the insurance policy application process (Table 2), where contract
deployment required 5.2 million gas units ($6.24 on Ethereum, $0.0302 on Arbitrum). The timer
functions for the 7-day proposal deadline and 5-day sign deadline consumed approximately 133,300 gas
units each, equivalent to $0.16 on Ethereum and $0.00078 on Arbitrum.</p>
        <p>The academic examination process, with its increased complexity and participant count, showed
comparable per-operation gas consumption (Table 3) but higher cumulative costs due to the greater
number of process steps. Contract deployment required 5.0 million gas units ($6.04 on Ethereum, $0.029
on Arbitrum), while individual operations ranged from 111,000 to 176,000 gas units.</p>
        <p>Function/Action</p>
        <p>Gas Used</p>
        <p>ETH Cost (USD)</p>
        <p>ARB Cost (USD)</p>
      </sec>
      <sec id="sec-4-3">
        <title>4.3. Layer 1 vs Layer 2 Cost Comparison</title>
        <p>Our analysis reveals that Arbitrum’s Layer 2 implementation reduces operational costs compared to
Ethereum’s Layer 1. This dramatic cost reduction maintains the same functional capabilities and security
properties while providing significantly better economic feasibility for complex business processes.
The cost diference is primarily attributable to two factors: lower gas prices on Arbitrum (median
0.0174 Gwei vs. 0.635 Gwei on Ethereum) and the lower native token value ($0.33397 for ARB vs.
$1,887.76 for ETH). While both factors contribute to cost reduction, the gas price diference represents
the architectural eficiency of Layer 2 solutions, while token value diferences reflect market conditions.
The median operation cost on Ethereum ($0.16-$0.18) would become prohibitive for complex processes
with many participants and operations, potentially costing hundreds of dollars for complete process
execution. In contrast, the same operations on Arbitrum cost fractions of a cent ($0.00076-$0.00090),
making even complex processes economically viable.</p>
      </sec>
      <sec id="sec-4-4">
        <title>4.4. Timer Event Performance</title>
        <p>Our block-number-based timer implementation demonstrated consistent and predictable behavior
across both networks. By converting time durations to block numbers (7,200 blocks per day, assuming
12-second block times), the system created a reliable execution framework that avoided timestamp
manipulation vulnerabilities. The gas consumption for timer-related functions remained consistent
with other operations, indicating no significant performance penalty for implementing time constraints.
This consistency suggests that complex time-dependent business processes can be implemented without
disproportionate cost increases for timer management. Security analysis confirmed that our
blockbased approach successfully prevented common time-based vulnerabilities. Both automated Slither
analysis and custom security checks verified the integrity of the timer implementation, with no critical
vulnerabilities detected.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Proposed Hybrid Layer 1-Layer 2 Architecture</title>
      <p>Our comparative analysis of Layer 1 and Layer 2 execution costs reveals a compelling economic case
for implementing BPMN processes on Layer 2 networks. However, certain operations may benefit
from the stronger security guarantees of Layer 1. This section introduces a systematic framework for
distributing process operations between Layer 1 and Layer 2 based on security requirements, economic
considerations, and operational characteristics.</p>
      <sec id="sec-5-1">
        <title>5.1. Operation Classification Framework</title>
        <p>We propose a classification framework that categorizes BPMN operations based on three dimensions:
security criticality, execution frequency, and data persistence requirements. This framework provides a
structured approach to determining the most suitable execution layer for each operation.
Security Criticality Assessment: Each operation is evaluated on a security criticality scale based on
Table 4.</p>
        <p>Financial impact
Legal significance
Trust requirements</p>
        <p>Operations that directly influence financial transactions or asset transfers require
the highest security guarantees
Operations that create legally binding commitments or satisfy regulatory
requirements demand strong immutability guarantees
Operations involving multiple participants with limited trust relationships benefit
from Layer 1’s stronger consensus mechanisms</p>
        <p>Critical state transitions Major state changes that fundamentally alter process status
Intermediate state updates Incremental changes that track process progression</p>
        <p>Audit information Supportive data primarily used for verification and transparency</p>
      </sec>
      <sec id="sec-5-2">
        <title>5.2. Layer Assignment Algorithm</title>
        <p>Based on the classification framework, Layer 1 primary candidates are process initialization operations
that establish core parameters, operations with high financial impact ( &lt;$1000 value transfer), final
commitment operations with legal significance and major state transitions that fundamentally alter
process status. Layer 2 primary candidates are routine operations with moderate security requirements,
frequent status update operations, operations with minimal financial impact and intermediate data
collection activities. Borderline cases can be timer events that enforce critical deadlines but have no
direct financial impact, decision gateways that influence but don’t directly control asset transfers and
operations with moderate legal significance. For borderline cases, we recommend additional assessment
of the relative cost diferential between Layer 1 and Layer 2 implementation, the specific security
guarantees required by stakeholders and the potential impact of a security compromise.</p>
      </sec>
      <sec id="sec-5-3">
        <title>5.3. Implementation Architecture</title>
        <p>Our conceptual architecture proposes a multi-contract approach with Layer 1 serving as the authoritative
system of record while Layer 2 handles routine operations.</p>
        <p>The Layer 1 contract serves as the process anchor, maintaining core process parameters and participant
information, critical state variables that define process status, authorization controls for cross-layer
synchronization and final state commitments and financial settlements.</p>
        <p>The Layer 2 contract handles daily operations, including routine task execution and status
tracking, intermediate state updates, timer event monitoring, gateway decision processing and audit trail
maintenance.</p>
        <p>To maintain process integrity across layers, our framework would require a secure synchronization
mechanism. Even if we do not implement this component in the current work, several established
approaches from literature could be adapted for this purpose. The events-based architecture described by
Bigiotti et al. [19] provides a promising foundation, where watchtowers monitor events from interface
smart contracts to coordinate state changes across chains. Their protocol demonstrates how two
transactions (one on each chain) can successfully complete cross-chain operations using standardized
JSON message formats for event semantics.</p>
        <p>Other potential approaches include Merkle-root state commitments for periodic validation [20],
message passing protocols like LayerZero [21], and cryptographic proof validation [22] systems similar
to those used in optimistic rollups.</p>
        <p>The practical implementation of such synchronization mechanisms represents an important direction
for future work, as our current focus is on the operation classification framework and on the economic
analysis of hybrid approaches.</p>
      </sec>
      <sec id="sec-5-4">
        <title>5.4. Case Study Application</title>
        <sec id="sec-5-4-1">
          <title>Applying our framework to the municipal document request process in Figure 1.</title>
          <p>Layer 1 Operations Layer 2 Operations
Process initialization (contract deployment) Request submission and reception
Final document delivery confirmation Request elaboration tasks
30-15 days deadline start and end Intermediate status updates
Gateway decisions (request completeness verification) Timer event triggers and tracking
New operator assignment
Feedback collection</p>
          <p>This distribution in Table 7 reduces the total process execution cost compared to a pure Layer 1
implementation while maintaining appropriate security guarantees for critical operations. Similar
patterns emerge in the insurance application and academic examination processes, with operations
involving financial commitments, legal obligations, or final state determinations assigned to Layer 1,
while routine coordination activities migrate to Layer 2.</p>
        </sec>
      </sec>
      <sec id="sec-5-5">
        <title>5.5. Security and Cost Analysis</title>
        <p>The proposed solution can balance security and cost considerations through strategic operation
placement. By executing only the most critical operations on Layer 1, we maintain strong security guarantees
where needed while leveraging Layer 2’s cost eficiency for routine operations. For a typical process
execution in our municipal document request case study, the hybrid approach reduces costs of a pure
Layer 1 implementation while maintaining Layer 1 security for critical operations. This represents
a balanced trade-of between the complete security of Layer 1 and the full economy of Layer 2. The
architecture’s security properties derive from Ethereum’s underlying consensus mechanism for critical
operations, while accepting Arbitrum’s security model for non-critical activities. This tiered approach
ensures that operations receive security guarantees proportional to their criticality.</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>6. Assumptions and Limitations</title>
      <sec id="sec-6-1">
        <title>6.1. Explicit Assumptions</title>
        <sec id="sec-6-1-1">
          <title>Implementing the three case studies, we made the following assumptions:</title>
        </sec>
        <sec id="sec-6-1-2">
          <title>Block-time model – Ethereum average of 12 s; Arbitrum latency 250 ms. Consensus security – honest-majority assumption for both layers. Gas-price window – median prices 14 Mar–13 Apr 2025 (see 3.4).</title>
          <p>We acknowledge these assumptions, which were selected empirically at the time of the study and can
be adjusted in future replications.</p>
        </sec>
      </sec>
      <sec id="sec-6-2">
        <title>6.2. Limitations and Threats to Validity</title>
        <p>While our approach demonstrates promising results in addressing time-constrained execution in
blockchain-based workflows, several limitations remain that warrant further attention. However,
some important considerations must be acknowledged when interpreting our findings. Our case studies,
while diverse, may not represent the full spectrum of business processes and timer event patterns.
Additional validation across a broader range of process types and industry domains would strengthen
the generalizability of our findings. The block-number-based time conversion assumes a relatively stable
block time (12 seconds for Ethereum); however, actual block times can vary due to network conditions,
potentially afecting the precision of timer events. Long-term monitoring of timer accuracy across
network conditions would provide additional validation. Our cost analysis used median gas prices over a
one-month period to provide a realistic baseline. However, gas prices can be highly volatile, particularly
during network congestion periods. Cost projections should account for this potential variability. While
our synchronization mechanism was conceptually described, a complete implementation and validation
of cross-layer communication remains to be developed. The practical reliability of maintaining
consistent state across layers requires further empirical validation. The security guarantees of our hybrid
architecture rely on the underlying security models of both Ethereum and Arbitrum. Changes to these
platforms or their security properties could impact the overall security of the implementation.</p>
      </sec>
    </sec>
    <sec id="sec-7">
      <title>7. Conclusion and Future Work</title>
      <p>This paper presented Block-Timer, an end-to-end evaluation of block-number timers for implementing
BPMN process execution with time constraints on blockchain. Our implementation of
block-numberbased for timer events ensures secure, manipulation-resistant time tracking without relying on external
time services, and the hybrid proposed solution can strategically distributes process operations between
Layer 1 and Layer 2 blockchains based on security requirements and cost considerations. Our empirical
analysis across three case studies demonstrated that Arbitrum’s Layer 2 implementation reduces
operational costs compared to Ethereum’s Layer 1, while maintaining the same functional capabilities.
The gas consumption for timer event operations remained comparable to other process operations
(approximately 133,000 gas units), indicating no significant performance penalty for implementing
time constraints. Although the hybrid architecture is not yet fully implemented, our preliminary
evaluation suggests that it strikes a favorable balance between security and cost-eficiency by executing
only the most critical operations (process initialization, major state transitions, and legally significant
commitments) on Layer 1, while delegating routine operations (status updates, data collection, and
timer tracking) to Layer 2. This approach ensures appropriate security guarantees for operations based
on their criticality while significantly reducing overall execution costs. Our security analysis confirmed
the integrity of the block-number-based timer implementation, with no critical vulnerabilities detected
through automated and custom security checks. By converting time durations to block numbers (7,200
blocks per day), our approach provides resilience against timestamp manipulation attacks while creating
a deterministic execution framework.</p>
      <p>Several promising directions for future research emerge from this work. Implementing and
evaluating a synchronization mechanisms between Layer 1 and Layer 2 deserves particular attention, with
emphasis on optimizing the balance between security guarantees and operational costs. Extending the
block-number-based approach to support more complex timer patterns represents another important
direction. This includes recurring timers, calendrical expressions (e.g., "every Monday"), and business
day calculations that account for holidays and working hours. By addressing these challenges, future
research can further enhance the eficiency, security, and practicality of blockchain-based business
process execution, particularly for time-sensitive multi-party workflows where trust and accountability
are essential.</p>
    </sec>
    <sec id="sec-8">
      <title>Acknowledgments</title>
      <p>This work was partially supported by project SERICS (PE00000014) under the MUR National Recovery
and Resilience Plan funded by the European Union-NextGenerationEU.</p>
      <p>This work was partially funded by Ministero dell’Università e della Ricerca (MUR), issue D.M. 351/2022
“Borse di Dottorato”—Dottorato di Ricerca di Interesse Nazionale in “Blockchain e Distributed Ledger
Technology”, under the National Recovery and Resilience Plan (NRRP).</p>
      <p>We acknowledge financial support under the project HALO (Hazard-Analysis and Anti-Counterfeiting
Ledger Oriented Protection) CUP F23C23000310008 in the context of Development Regional Program
2020-2024 Strategy 2-Economics Identity Project 2.1 - Technological Research and Innovation.</p>
      <p>We acknowledge financial support under the National Recovery and Resilience Plan (NRRP), Mission
4 Component 2 Investment 1.5-Call for tender No. 3277 published on 30 December 2021 by the Italian
Ministry of University and Research (MUR) funded by the European Union-NextGenerationEU. Project
Code ECS0000038—Project Title eINS Ecosystem of Innovation for Next Generation Sardinia—CUP
F53C22000430001-Grant Assignment Decree No. 1056 adopted on 23 June 2022 by the Italian Ministry
of University and Research (MUR).</p>
      <p>We acknowledge financial support under the project code PE0000021, Concession Decree No. 1561
of 11.10.2022 adopted by Ministero dell’Università e della Ricerca (MUR), CUP - to be indicated by
each Beneficiary, according to attachment E of Decree No. 1561/2022, Project title “Network 4 Energy
Sustainable Transition – NEST”.</p>
      <p>We acknowledge financial support under the National Recovery and Resilience Plan (NRRP), by the
Italian Ministry of University and Research (MUR) funded by the European Union-NextGenerationEU.
Project Code ECS0000038—Project eINS Ecosystem of Innovation for Next Generation Sardinia—CUP
F53C22000430001-Grant Assignment for the PoC “TraCCCS: Tracciabilità, Certificazione Blockchain e
Valorizzazione dei Carbon Credits per PMI Sarde con Impianti di Produzione di Energia Rinnovabile”.
Declaration on Generative AI: During the preparation of this work, the author(s) used ChatGPT,
Grammarly in order to: Grammar and spelling check, Paraphrase and reword. After using this
tool/service, the author(s) reviewed and edited the content as needed and take(s) full responsibility for the
publication’s content.
for eficient development of complex multi-party interaction scenarios, Applied Sciences 13 (2023).</p>
      <p>URL: https://www.mdpi.com/2076-3417/13/14/8094. doi:10.3390/app13148094.
[18] J. Feist, G. Grieco, A. Groce, Slither: A static analysis framework for smart contracts, in:
2019 IEEE/ACM 2nd International Workshop on Emerging Trends in Software Engineering for
Blockchain (WETSEB), 2019, pp. 8–15. doi:10.1109/WETSEB.2019.00008.
[19] A. Bigiotti, L. Mostarda, A. Navarra, A. Pinna, R. Tonelli, M. Vaccargiu, Interoperability between
evm-based blockchains, in: L. Barolli (Ed.), Advanced Information Networking and Applications,
Springer Nature Switzerland, Cham, 2024, pp. 98–109.
[20] M. Westerkamp, J. Eberhardt, zkrelay: Facilitating sidechains using zksnark-based chain-relays,
in: 2020 IEEE European Symposium on Security and Privacy Workshops (EuroSPW), 2020, pp.
378–386. doi:10.1109/EuroSPW51379.2020.00058.
[21] R. Zarick, B. Pellegrino, C. Banister, Layerzero: Trustless omnichain interoperability protocol,
2021. URL: https://arxiv.org/abs/2110.13871. arXiv:2110.13871.
[22] T. Xie, J. Zhang, Z. Cheng, F. Zhang, Y. Zhang, Y. Jia, D. Boneh, D. Song, zkbridge: Trustless
cross-chain bridges made practical, in: Proceedings of the 2022 ACM SIGSAC Conference on
Computer and Communications Security, CCS ’22, Association for Computing Machinery, New
York, NY, USA, 2022, p. 3003–3017. URL: https://doi.org/10.1145/3548606.3560652. doi:10.1145/
3548606.3560652.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>T.</given-names>
            <surname>Allweyer</surname>
          </string-name>
          , BPMN
          <volume>2</volume>
          .
          <article-title>0: introduction to the standard for business process modeling</article-title>
          ,
          <source>BoD-Books on Demand</source>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>W.</given-names>
            <surname>Viriyasitavat</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. Da</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Niyato</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Bi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Hoonsopon</surname>
          </string-name>
          ,
          <article-title>Applications of blockchain in business processes: A comprehensive review</article-title>
          ,
          <source>Ieee Access</source>
          <volume>10</volume>
          (
          <year>2022</year>
          )
          <fpage>118900</fpage>
          -
          <lpage>118925</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>J.</given-names>
            <surname>Ladleif</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Weske, Time in blockchain-based process execution</article-title>
          ,
          <source>in: 2020 IEEE 24th International Enterprise Distributed Object Computing Conference (EDOC)</source>
          ,
          <year>2020</year>
          , pp.
          <fpage>217</fpage>
          -
          <lpage>226</lpage>
          . doi:
          <volume>10</volume>
          .1109/ EDOC49727.
          <year>2020</year>
          .
          <volume>00034</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>T.</given-names>
            <surname>Neudecker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Hartenstein</surname>
          </string-name>
          ,
          <article-title>Network layer aspects of permissionless blockchains</article-title>
          ,
          <source>IEEE Communications Surveys &amp; Tutorials</source>
          <volume>21</volume>
          (
          <year>2018</year>
          )
          <fpage>838</fpage>
          -
          <lpage>857</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>A.</given-names>
            <surname>Gangwal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H. R.</given-names>
            <surname>Gangavalli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Thirupathi</surname>
          </string-name>
          ,
          <article-title>A survey of layer-two blockchain protocols</article-title>
          ,
          <source>Journal of Network and Computer Applications</source>
          <volume>209</volume>
          (
          <year>2023</year>
          )
          <fpage>103539</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>C.</given-names>
            <surname>Di Ciccio</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Cecconi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Dumas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>García-Bañuelos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>López-Pintado</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Lu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Mendling</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Ponomarev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. Binh</given-names>
            <surname>Tran</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Weber</surname>
          </string-name>
          ,
          <article-title>Blockchain support for collaborative business processes</article-title>
          ,
          <source>Informatik Spektrum</source>
          <volume>42</volume>
          (
          <year>2019</year>
          )
          <fpage>182</fpage>
          -
          <lpage>190</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>N.</given-names>
            <surname>Nousias</surname>
          </string-name>
          , G. Tsakalidis,
          <string-name>
            <given-names>S.</given-names>
            <surname>Petridou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Vergidis</surname>
          </string-name>
          ,
          <article-title>Modelling the development and deployment of decentralized applications in ethereum blockchain: a bpmn-based approach</article-title>
          ,
          <source>in: International Conference on Decision Support System Technology</source>
          , Springer,
          <year>2022</year>
          , pp.
          <fpage>55</fpage>
          -
          <lpage>67</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>A. B.</given-names>
            <surname>Tran</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Lu</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Weber</surname>
          </string-name>
          ,
          <article-title>Lorikeet: A model-driven engineering tool for blockchain-based business process execution and asset management</article-title>
          ., in: BPM (dissertation/demos/industry),
          <year>2018</year>
          , pp.
          <fpage>56</fpage>
          -
          <lpage>60</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>O.</given-names>
            <surname>López-Pintado</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>García-Bañuelos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Dumas</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Weber</surname>
          </string-name>
          ,
          <article-title>Caterpillar: A blockchain-based business process management system</article-title>
          .,
          <source>BPM (Demos) 172</source>
          (
          <year>2017</year>
          )
          <fpage>1</fpage>
          -
          <lpage>5</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>F.</given-names>
            <surname>Corradini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Marcelletti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Morichetta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Polini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Re</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Tiezzi</surname>
          </string-name>
          ,
          <article-title>Blockchain-based execution of bpmn choreographies with multiple instances, Distributed Ledger Technologies: Research and Practice (</article-title>
          <year>2023</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>F.</given-names>
            <surname>Corradini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Marcelletti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Morichetta</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Polini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Re</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Tiezzi</surname>
          </string-name>
          ,
          <article-title>A flexible approach to multi-party business process execution on blockchain</article-title>
          ,
          <source>Future Generation Computer Systems</source>
          <volume>147</volume>
          (
          <year>2023</year>
          )
          <fpage>219</fpage>
          -
          <lpage>234</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>T.</given-names>
            <surname>Eichinger</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ebermann</surname>
          </string-name>
          ,
          <article-title>Can we efectively use smart contracts to stipulate time constraints?</article-title>
          ,
          <source>in: 2022 IEEE International Conference on Decentralized Applications and Infrastructures (DAPPS)</source>
          , IEEE,
          <year>2022</year>
          , pp.
          <fpage>11</fpage>
          -
          <lpage>18</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>S.-W.</given-names>
            <surname>Chae</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-I.</given-names>
            <surname>Kim</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Park</surname>
          </string-name>
          ,
          <article-title>Practical time-release blockchain</article-title>
          ,
          <source>Electronics</source>
          <volume>9</volume>
          (
          <year>2020</year>
          ). URL: https://www.mdpi.com/2079-9292/9/4/672. doi:
          <volume>10</volume>
          .3390/electronics9040672.
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>L.</given-names>
            <surname>Argento</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Buccafurri</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Furfaro</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Graziano</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Guzzo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Lax</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Pasqua</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Saccà</surname>
          </string-name>
          ,
          <article-title>Id-service: A blockchain-based platform to support digital-identity-aware service accountability</article-title>
          ,
          <source>Applied Sciences</source>
          <volume>11</volume>
          (
          <year>2021</year>
          ). URL: https://www.mdpi.com/2076-3417/11/1/165. doi:
          <volume>10</volume>
          .3390/app11010165.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>M.</given-names>
            <surname>Alfarisy</surname>
          </string-name>
          , Suhardi,
          <string-name>
            <given-names>W.</given-names>
            <surname>Muhamad</surname>
          </string-name>
          ,
          <article-title>Development of a service-oriented platform and blockchain as a service to secure recording of measured fishing data based on quota in support of the blue economy</article-title>
          ,
          <source>in: 2024 International Conference on ICT for Smart Society (ICISS)</source>
          ,
          <year>2024</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>6</lpage>
          . doi:
          <volume>10</volume>
          .1109/ICISS62896.
          <year>2024</year>
          .
          <volume>10751451</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>M.</given-names>
            <surname>Pirani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Cucchiarelli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Naeem</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Spalazzi</surname>
          </string-name>
          ,
          <article-title>A blockchain-driven cyber-systemic approach to hybrid reality</article-title>
          ,
          <source>Systems</source>
          <volume>13</volume>
          (
          <year>2025</year>
          ). URL: https://www.mdpi.com/2079-8954/13/4/294. doi:
          <volume>10</volume>
          .3390/ systems13040294.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>X.</given-names>
            <surname>Shen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Z.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <article-title>A reuse-oriented visual smart contract code generator</article-title>
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>