Skip to Main content Skip to Navigation
Journal articles

Complexité de l'algorithme de l'opacité dans les systèmes Workflows centrés sur les documents

Mohamadou Lamine Diouf 1, * Sophie Pinchinat 2 
* Corresponding author
2 LogicA - Logic and Applications
ENS Cachan - École normale supérieure - Cachan, UR1 - Université de Rennes 1, IRISA-D4 - LANGAGE ET GÉNIE LOGICIEL
Abstract : A property (of an object) is opaque to an observer when he or she cannot deduce the property from its set of observations. If each observer is attached to a given set of properties (the so-called secrets), then the system is said to be opaque if each secret is opaque to the corresponding observer. We study in this paper, the complexity of opacity algorithm in data-centric workflows systems. We show that the complexity of this algorithm is EXPTIME-complete. Using the reduction problem, whe show that we can reduce the complexity of opacity problem to wellknow problem, the intersection of nonemptyness problem of Tree automata in polynomial time.
Document type :
Journal articles
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01351970
Contributor : Mohamadou Lamine Diouf Connect in order to contact the contributor
Submitted on : Thursday, November 24, 2016 - 3:02:28 PM
Last modification on : Wednesday, November 3, 2021 - 4:34:45 AM
Long-term archiving on: : Monday, March 20, 2017 - 8:45:10 PM

File

ARIMA-Vol25-Diouf (1).pdf
Files produced by the author(s)

Identifiers

Citation

Mohamadou Lamine Diouf, Sophie Pinchinat. Complexité de l'algorithme de l'opacité dans les systèmes Workflows centrés sur les documents. Revue Africaine de la Recherche en Informatique et Mathématiques Appliquées, INRIA, 2016, Volume 25 - 2016 - Special issue CNRIA 2015, ⟨10.46298/arima.1479⟩. ⟨hal-01351970v2⟩

Share

Metrics

Record views

283

Files downloads

627