📖
Formal verification of declarative specifications of BPs: DCR2CPN-based approach
Ikram Garfatta, Kaïs Klai, Walid Gaaloul

Formal verification of declarative specifications of BPs: DCR2CPN-based approach

Science & Mathematics Published 2024 Verification Pending

Overview & Synopsis

Declarative business process models, notably Dynamic Condition Response (DCR) graphs, have gained traction as an alternative to traditional imperative approaches. However, adequate verification tools for such models remain scarce. This paper proposes a model-checking approach for DCR graphs verification using Coloured Petri Nets (CPN) as a pivot language. The transformation from DCR to CPN is proven to preserve semantics, ensuring the resulting model aligns with the original. Once transformed, the CPN model can be checked by any model checker to verify specific properties. We have automated this process via a C++ prototype that generates CPNs in the specification language of Helena, the model checker that we choose to leverage in our work.

Indexed from repository: HAL Open Science (hal.science)
Loading document from verified source...
Keyboard Shortcuts: ← / → for pages • + / - for zoom • 0 to fit width Powered by Mozilla PDF.js v3.11

Document Information

Document Title Formal verification of declarative specifications of BPs: DCR2CPN-based approach
Author / Organization Ikram Garfatta, Kaïs Klai, Walid Gaaloul
Subject & Discipline Multidisciplinary Academic Open Research
Categories Science & Mathematics
Publication Year 2024
License / Rights Open Access / Creative Commons
Resource Verification Listed PDF (Verification Pending)
Original Host Website HAL Open Science (hal.science)
File Format application/pdf (Portable Document Format)
Language EN
Catalog ID DOC-169739
Original Source Link Visit Source Page on hal.science »