InforLorV4, Hal, Corpus, bibRecord, 000D75

An efficient algorithm for workflow graph structural verification

Identifieur interne : 000D75 ( Hal/Corpus ); précédent : 000D74; suivant : 000D76

An efficient algorithm for workflow graph structural verification

Auteurs : Fodé Touré ; Karim Baïna ; Khalid Benali

Source :

RBID : Hal:inria-00325187

Abstract

Any big enterprise is organized around business process hav- ing a value towards its customers and its products. Appropriate deﬁnition, analysis, checking and improvement of those business process models are indispensable before their deployment within workﬂow management systems. In this paper, we focus on business process model veriﬁcation that insures business process structural correctness. Our proposal consist in a new efficient hybrid algorithm of workﬂow graph structural validation combining graph reduction and traversal mechanisms. Our al- gorithm will be disussed and compared to existing workﬂow structural checking approaches from completeness and performance points of view.

Url:

https://hal.inria.fr/inria-00325187

Links to Exploration step

Hal:inria-00325187

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">An efficient algorithm for workflow graph structural verification</title>
<author><name sortKey="Toure, Fode" sort="Toure, Fode" uniqKey="Toure F" first="Fodé" last="Touré">Fodé Touré</name>
<affiliation><hal:affiliation type="laboratory" xml:id="struct-40602" status="VALID"><orgName>Ecole Nationale Supérieure d'Informatique et d'Analyses des Systèmes</orgName>
<orgName type="acronym">ENSIAS</orgName>
<desc><address><addrLine>BP 713 Agdal - Rabat, Morocco</addrLine>
<country key="MA"></country>
</address>
<ref type="url">http://www.ensias.ma/</ref>
</desc>
<listRelation><relation active="#struct-301244" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-301244" type="direct"><org type="institution" xml:id="struct-301244" status="VALID"><orgName>Université Mohamed V - Souissi</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
<author><name sortKey="Baina, Karim" sort="Baina, Karim" uniqKey="Baina K" first="Karim" last="Baïna">Karim Baïna</name>
<affiliation><hal:affiliation type="laboratory" xml:id="struct-40602" status="VALID"><orgName>Ecole Nationale Supérieure d'Informatique et d'Analyses des Systèmes</orgName>
<orgName type="acronym">ENSIAS</orgName>
<desc><address><addrLine>BP 713 Agdal - Rabat, Morocco</addrLine>
<country key="MA"></country>
</address>
<ref type="url">http://www.ensias.ma/</ref>
</desc>
<listRelation><relation active="#struct-301244" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-301244" type="direct"><org type="institution" xml:id="struct-301244" status="VALID"><orgName>Université Mohamed V - Souissi</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
<author><name sortKey="Benali, Khalid" sort="Benali, Khalid" uniqKey="Benali K" first="Khalid" last="Benali">Khalid Benali</name>
<affiliation><hal:affiliation type="researchteam" xml:id="struct-2349" status="OLD"><idno type="RNSR">199918294U</idno>
<orgName>Environment for cooperation</orgName>
<orgName type="acronym">ECOO</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/ecoo</ref>
</desc>
<listRelation><relation active="#struct-160" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-300291" type="indirect"></relation>
<relation active="#struct-300292" type="indirect"></relation>
<relation active="#struct-300293" type="indirect"></relation>
<relation active="#struct-2496" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation name="UMR7503" active="#struct-441569" type="direct"></relation>
<relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-300291" type="direct"></relation>
<relation active="#struct-300292" type="direct"></relation>
<relation active="#struct-300293" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName>
<orgName type="acronym">UHP</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName>
<orgName type="acronym">INPL</orgName>
<date type="end">2011-12-31</date>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-2496" type="direct"><org type="laboratory" xml:id="struct-2496" status="OLD"><orgName>INRIA Lorraine</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/centre-de-recherche-inria/nancy-grand-est</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:inria-00325187</idno>
<idno type="halId">inria-00325187</idno>
<idno type="halUri">https://hal.inria.fr/inria-00325187</idno>
<idno type="url">https://hal.inria.fr/inria-00325187</idno>
<date when="2008-11">2008-11</date>
<idno type="wicri:Area/Hal/Corpus">000D75</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">An efficient algorithm for workflow graph structural verification</title>
<author><name sortKey="Toure, Fode" sort="Toure, Fode" uniqKey="Toure F" first="Fodé" last="Touré">Fodé Touré</name>
<affiliation><hal:affiliation type="laboratory" xml:id="struct-40602" status="VALID"><orgName>Ecole Nationale Supérieure d'Informatique et d'Analyses des Systèmes</orgName>
<orgName type="acronym">ENSIAS</orgName>
<desc><address><addrLine>BP 713 Agdal - Rabat, Morocco</addrLine>
<country key="MA"></country>
</address>
<ref type="url">http://www.ensias.ma/</ref>
</desc>
<listRelation><relation active="#struct-301244" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-301244" type="direct"><org type="institution" xml:id="struct-301244" status="VALID"><orgName>Université Mohamed V - Souissi</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
<author><name sortKey="Baina, Karim" sort="Baina, Karim" uniqKey="Baina K" first="Karim" last="Baïna">Karim Baïna</name>
<affiliation><hal:affiliation type="laboratory" xml:id="struct-40602" status="VALID"><orgName>Ecole Nationale Supérieure d'Informatique et d'Analyses des Systèmes</orgName>
<orgName type="acronym">ENSIAS</orgName>
<desc><address><addrLine>BP 713 Agdal - Rabat, Morocco</addrLine>
<country key="MA"></country>
</address>
<ref type="url">http://www.ensias.ma/</ref>
</desc>
<listRelation><relation active="#struct-301244" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-301244" type="direct"><org type="institution" xml:id="struct-301244" status="VALID"><orgName>Université Mohamed V - Souissi</orgName>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
<author><name sortKey="Benali, Khalid" sort="Benali, Khalid" uniqKey="Benali K" first="Khalid" last="Benali">Khalid Benali</name>
<affiliation><hal:affiliation type="researchteam" xml:id="struct-2349" status="OLD"><idno type="RNSR">199918294U</idno>
<orgName>Environment for cooperation</orgName>
<orgName type="acronym">ECOO</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/ecoo</ref>
</desc>
<listRelation><relation active="#struct-160" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-300291" type="indirect"></relation>
<relation active="#struct-300292" type="indirect"></relation>
<relation active="#struct-300293" type="indirect"></relation>
<relation active="#struct-2496" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation name="UMR7503" active="#struct-441569" type="direct"></relation>
<relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-300291" type="direct"></relation>
<relation active="#struct-300292" type="direct"></relation>
<relation active="#struct-300293" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName>
<orgName type="acronym">UHP</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName>
<orgName type="acronym">INPL</orgName>
<date type="end">2011-12-31</date>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-2496" type="direct"><org type="laboratory" xml:id="struct-2496" status="OLD"><orgName>INRIA Lorraine</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/centre-de-recherche-inria/nancy-grand-est</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
</affiliation>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass></textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Any big enterprise is organized around business process hav- ing a value towards its customers and its products. Appropriate deﬁnition, analysis, checking and improvement of those business process models are indispensable before their deployment within workﬂow management systems. In this paper, we focus on business process model veriﬁcation that insures business process structural correctness. Our proposal consist in a new efficient hybrid algorithm of workﬂow graph structural validation combining graph reduction and traversal mechanisms. Our al- gorithm will be disussed and compared to existing workﬂow structural checking approaches from completeness and performance points of view.</div>
</front>
</TEI>
<hal api="V3"><titleStmt><title xml:lang="en">An efficient algorithm for workflow graph structural verification</title>
<author role="aut"><persName><forename type="first">Fodé</forename>
<surname>Touré</surname>
</persName>
<email></email>
<idno type="halauthor">355586</idno>
<affiliation ref="#struct-40602"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Karim</forename>
<surname>Baïna</surname>
</persName>
<email></email>
<idno type="halauthor">63619</idno>
<affiliation ref="#struct-40602"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Khalid</forename>
<surname>Benali</surname>
</persName>
<email>benali@loria.fr</email>
<idno type="halauthor">63621</idno>
<affiliation ref="#struct-2349"></affiliation>
</author>
<editor role="depositor"><persName><forename>Khalid</forename>
<surname>Benali</surname>
</persName>
<email>khalid.benali@loria.fr</email>
</editor>
</titleStmt>
<editionStmt><edition n="v1" type="current"><date type="whenSubmitted">2008-09-26 15:05:40</date>
<date type="whenModified">2016-05-19 01:09:14</date>
<date type="whenReleased">2008-09-26 15:05:40</date>
<date type="whenProduced">2008-11</date>
</edition>
<respStmt><resp>contributor</resp>
<name key="103773"><persName><forename>Khalid</forename>
<surname>Benali</surname>
</persName>
<email>khalid.benali@loria.fr</email>
</name>
</respStmt>
</editionStmt>
<publicationStmt><distributor>CCSD</distributor>
<idno type="halId">inria-00325187</idno>
<idno type="halUri">https://hal.inria.fr/inria-00325187</idno>
<idno type="halBibtex">toure:inria-00325187</idno>
<idno type="halRefHtml">Coopis 2008 (16th International Conference on cooperative information systems, On the Move, Nov 2008, Monterrey, Mexico. 2008</idno>
<idno type="halRef">Coopis 2008 (16th International Conference on cooperative information systems, On the Move, Nov 2008, Monterrey, Mexico. 2008</idno>
</publicationStmt>
<seriesStmt><idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
<idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
<idno type="stamp" n="INPL">Institut National Polytechnique de Lorraine</idno>
<idno type="stamp" n="LORIA2">Publications du LORIA</idno>
<idno type="stamp" n="INRIA-NANCY-GRAND-EST">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="LORIA">LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno>
<idno type="stamp" n="LORIA-NSS" p="LORIA">Réseaux, systèmes et services</idno>
<idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno>
<idno type="stamp" n="INRIA-LORRAINE">INRIA Nancy - Grand Est</idno>
<idno type="stamp" n="LABO-LORIA-SET" p="LORIA">LABO-LORIA-SET</idno>
</seriesStmt>
<notesStmt><note type="audience" n="2">International</note>
<note type="invited" n="0">No</note>
<note type="popular" n="0">No</note>
<note type="peer" n="1">Yes</note>
<note type="proceedings" n="1">Yes</note>
</notesStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">An efficient algorithm for workflow graph structural verification</title>
<author role="aut"><persName><forename type="first">Fodé</forename>
<surname>Touré</surname>
</persName>
<idno type="halAuthorId">355586</idno>
<affiliation ref="#struct-40602"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Karim</forename>
<surname>Baïna</surname>
</persName>
<idno type="halAuthorId">63619</idno>
<affiliation ref="#struct-40602"></affiliation>
</author>
<author role="aut"><persName><forename type="first">Khalid</forename>
<surname>Benali</surname>
</persName>
<email>benali@loria.fr</email>
<idno type="halAuthorId">63621</idno>
<affiliation ref="#struct-2349"></affiliation>
</author>
</analytic>
<monogr><meeting><title>Coopis 2008 (16th International Conference on cooperative information systems, On the Move</title>
<date type="start">2008-11</date>
<settlement>Monterrey</settlement>
<country key="MX">Mexico</country>
</meeting>
<imprint><date type="datePub">2008</date>
</imprint>
</monogr>
</biblStruct>
</sourceDesc>
<profileDesc><langUsage><language ident="en">English</language>
</langUsage>
<textClass><classCode scheme="halDomain" n="info.info-ir">Computer Science [cs]/Information Retrieval [cs.IR]</classCode>
<classCode scheme="halTypology" n="COMM">Conference papers</classCode>
</textClass>
<abstract xml:lang="en">Any big enterprise is organized around business process hav- ing a value towards its customers and its products. Appropriate deﬁnition, analysis, checking and improvement of those business process models are indispensable before their deployment within workﬂow management systems. In this paper, we focus on business process model veriﬁcation that insures business process structural correctness. Our proposal consist in a new efficient hybrid algorithm of workﬂow graph structural validation combining graph reduction and traversal mechanisms. Our al- gorithm will be disussed and compared to existing workﬂow structural checking approaches from completeness and performance points of view.</abstract>
</profileDesc>
</hal>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Hal/Corpus

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000D75 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Hal/Corpus/biblio.hfd -nk 000D75 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Hal
   |étape=   Corpus
   |type=    RBID
   |clé=     Hal:inria-00325187
   |texte=   An efficient algorithm for workflow graph structural verification
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

An efficient algorithm for workflow graph structural verification

An efficient algorithm for workflow graph structural verification

Source :

Abstract

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri