V\'erification Formelle des Processus Workflow Collaboratifs

TL;DR

This paper introduces a formal verification method for collaborative workflow processes using model checking with SPIN, translating workflow specifications into Promela and verifying soundness properties expressed in LTL.

Contribution

It presents a novel approach to verify soundness of workflow processes by translating WF-nets into Promela and applying SPIN model checker for property verification.

Findings

Successfully verified soundness properties of WF-nets

Extended verification to k-soundness and (k,R)-soundness

Demonstrated effectiveness of model checking in workflow verification

Abstract

In this paper, we present a method of verification of collaborative workflow processes based on model checking techniques. In particular, we propose to verify soundness properties of these processes using SPIN model checker. First we translate the adopted specification of workflows (i.e. the WF-net) to Promela which is the description language of models to be verified by SPIN. Then we express the soundness properties in Linear Temporal Logic (LTL) and use SPIN to test whether each property is satisfied by the Promela model of the WF-net in question. Finally, we express the properties of k-soundness for WF-nets modeling multiple instances and (k,R)-soundness for workflow processes with multiple instances and sharing resources.