TY  - EJOU
AU  - Taryana, Acep 
AU  - Adzkiya, Dieky 
AU  - Mufid, Muhammad Syifa’ul 
AU  - Mukhlash, Imam 

TI  - Deadlock Verification of the Room Allocation Workflow in an EHR System Using UPPAAL
T2  - Computers, Materials \& Continua

PY  - 2026
VL  - 89
IS  - 1
SN  - 1546-2226

AB  - A systematic approach is necessary to address concurrency issues, timing violations, and logical safety breaches in healthcare systems, as traditional empirical testing often fails to uncover non-deterministic flaws that can endanger patient safety. This study proposes a rigorous formal verification methodology based on a triple-constraint framework to prove system reliability prior to the implementation phase. The patient room allocation workflow was modeled as a network of Timed Automata (TA) within the UPPAAL model checker, allowing for the formal evaluation of concurrent processes and shared resources. Our methodology follows three core phases: (1) Formalization, where critical requirements are translated into Timed Computation Tree Logic (TCTL) properties targeting three pillars: temporal bounds, safety invariants (e.g., category matching), and deadlock-freedom guarantees (e.g., <mml:math id="mml-ieqn-1"><mml:mi>A</mml:mi><mml:mi>◻</mml:mi><mml:mi mathvariant="normal">¬</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:mi>a</mml:mi><mml:mi>d</mml:mi><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:mi>c</mml:mi><mml:mi>k</mml:mi></mml:math>); (2) Iterative Formal Refinement, a systematic algorithm that utilizes UPPAAL to identify and eliminate design flaws by dynamically refining automata components—such as location invariants, transition guards, and synchronization channels—based on counter-example traces; and (3) Artifact Generation, where the verified formal model is systematically translated into reliable software engineering blueprints. The iterative refinement process culminated in a final TA model mathematically proven to be free from deadlocks, timelocks, and unsafe states, which was successfully scaled under high queueing loads via Statistical Model Checking (SMC). This verified mathematical blueprint was then synthesized into Unified Modeling Language (UML) design artifacts, specifically class, sequence, and state machine diagrams. By integrating a triple-constraint formal verification at the design stage, this methodology proactively prevents concurrency failures, bridging mathematical guarantees with practical software engineering. Furthermore, the comparative performance evaluation reveals that while exact state-space verification triggers Out-of-Memory (OOM) failures at merely <mml:math id="mml-ieqn-2"><mml:mi>N</mml:mi><mml:mo>≥</mml:mo><mml:mn>6</mml:mn></mml:math> concurrent processes due to state-space explosion, the proposed TA-SMC framework successfully neutralizes this limitation. By bridging the gap between lightweight simulation and formal rigor, our approach smoothly scales up to <mml:math id="mml-ieqn-3"><mml:mi>N</mml:mi><mml:mo>=</mml:mo><mml:mn>25</mml:mn></mml:math> concurrent processes, maintaining a strictly constant peak memory footprint of <mml:math id="mml-ieqn-4"><mml:mo>≈</mml:mo></mml:math>14 MB, while simultaneously guaranteeing <mml:math id="mml-ieqn-5"><mml:mo>≥</mml:mo></mml:math>99% statistical confidence for critical safety invariants. These quantitative results firmly establish the proposed methodology as a highly robust and practically viable solution for evaluating complex, resource-contended clinical workflows.
KW  - Formal verification; timed automata; model checking; software design; electronic health record; deadlock prevention; triple-constraint

DO  - 10.32604/cmc.2026.082012