REVIEW
V\'erification Formelle des Processus Workflow Collaboratifs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original 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.
Discussion (0). Continue with ORCID to comment.