Constraint Solving for Verifying Modal Specifications of Workflow Nets with Data

Hadrien Bride 1, 2 Olga Kouchnarenko 1, 2 Fabien Peureux 1
2 CASSIS - Combination of approaches to the security of infinite states systems
FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174), Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : For improving efficiency and productivity companies are used to work with workflows that allow them to manage the tasks and steps of business processes. Furthermore, modalities have been designed to allow loose specifications by indicating whether activities are necessary or admissible. This paper aims at verifying modal specifications of coloured workflows with data assigned to the tokens and modified by transitions. To this end, executions of coloured workflow nets are modelled using constraint systems, and constraint solving is used to verify modal specifications specifying necessary or admissible behaviours. An implementation supporting the proposed approach and promising experimental results on an issue tracking system constitute a practical contribution.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-01242370
Contributor : Olga Kouchnarenko <>
Submitted on : Friday, December 11, 2015 - 10:56:31 PM
Last modification on : Tuesday, December 18, 2018 - 4:38:25 PM

Identifiers

  • HAL Id : hal-01242370, version 1

Citation

Hadrien Bride, Olga Kouchnarenko, Fabien Peureux. Constraint Solving for Verifying Modal Specifications of Workflow Nets with Data. The Ershov Informatics Conference (the PSI Conference Series, 10th edition) , Aug 2015, Kazan, Russia. pp.15. ⟨hal-01242370⟩

Share

Metrics

Record views

263