Zohra Sbaï | Searcharxiv

arXiv2013

Vérification Formelle des Processus Workflow Collaboratifs

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.

cs.SE↗

arXiv2013

Model Checking Techniques for Verification of an Encryption Scheme for Wireless Sensor Networks

In this paper, we deal with the formal verification of an encryption scheme for Wireless Sensor Networks (WSNs). Especially, we present our first results on building a framework dedicated to modelling and verification of WSNs aspects. To achieve our goal, we propose to specify WSNs models written in Petri nets using Promela constructs in order to verify correctness properties of them using SPIN Model checker. We first specify in Promela a Petri net description of an encryption scheme for WSNs that describes its behavior. Then, correctness properties that express requirements on the system's behavior are formulated in Linear Temporal Logic (LTL). Finally, SPIN model checker is used to check if a specific correctness property holds for the model, and, if not, to provide a counterexample: a computation that does not satisfy this property. This counterexample will help to detect the source of the eventual problem and to correct it.

cs.LO↗