About: On verification of nested workflows with extra constraints: From theory to practice

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: On verification of nested workflows with extra constraints: From theory to practice Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
rdfs:seeAlso	http://dx.doi.org/10.1016/j.eswa.2013.08.021
Description	Workflows are used to formally describe processes of various types such as business and manufacturing processes. One of the critical tasks of workflow management is automated discovery of possible flaws in the workflow - workflow verification. In this paper, we formalize the problem of workflow verification as the problem of verifying that there exists a feasible process for each task in the workflow. This problem is tractable for nested workflows that are the workflows with a hierarchical structure similar to hierarchical task networks in planning. However, we show that if extra synchronization, precedence, or causal constraints are added to the nested structure, the workflow verification problem becomes NP-complete. We present a workflow verification algorithm for nested workflows with extra constraints that is based on constraint satisfaction techniques and exploits an incremental temporal reasoning algorithm. We then experimentally demonstrate efficiency of the proposed techniques on randomly generated workflows with various structures and sizes. The paper is concluded by notes on exploiting the presented techniques in the application FlowOpt for modeling, optimizing, visualizing, and analyzing production workflows. Workflows are used to formally describe processes of various types such as business and manufacturing processes. One of the critical tasks of workflow management is automated discovery of possible flaws in the workflow - workflow verification. In this paper, we formalize the problem of workflow verification as the problem of verifying that there exists a feasible process for each task in the workflow. This problem is tractable for nested workflows that are the workflows with a hierarchical structure similar to hierarchical task networks in planning. However, we show that if extra synchronization, precedence, or causal constraints are added to the nested structure, the workflow verification problem becomes NP-complete. We present a workflow verification algorithm for nested workflows with extra constraints that is based on constraint satisfaction techniques and exploits an incremental temporal reasoning algorithm. We then experimentally demonstrate efficiency of the proposed techniques on randomly generated workflows with various structures and sizes. The paper is concluded by notes on exploiting the presented techniques in the application FlowOpt for modeling, optimizing, visualizing, and analyzing production workflows. (en)
Title	On verification of nested workflows with extra constraints: From theory to practice On verification of nested workflows with extra constraints: From theory to practice (en)
skos:prefLabel	On verification of nested workflows with extra constraints: From theory to practice On verification of nested workflows with extra constraints: From theory to practice (en)
skos:notation	RIV/00216208:11320/14:10194760!RIV15-MSM-11320___
http://linked.open...avai/riv/aktivita	I P
http://linked.open...avai/riv/aktivity	I, P(GAP103/10/1287), P(GAP202/10/1188)
http://linked.open...iv/cisloPeriodika	3
http://linked.open...vai/riv/dodaniDat	2015
http://linked.open...aciTvurceVysledku	Barták, Roman Rovenský, Vladimír
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Univerzita Karlova v Praze / Matematicko-fyzikální fakulta
http://linked.open...dnocenehoVysledku	34549
http://linked.open...ai/riv/idVysledku	RIV/00216208:11320/14:10194760
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Temporal consistency; Constraint satisfaction; Complexity; Verification; Workflow (en)
http://linked.open.../riv/klicoveSlovo	Verification Workflow Complexity Constraint satisfaction Temporal consistency
http://linked.open...odStatuVydavatele	US - Spojené státy americké
http://linked.open...ontrolniKodProRIV	[C850F8C26BE8]
http://linked.open...i/riv/nazevZdroje	Expert Systems with Applications
http://linked.open...in/vavai/riv/obor	JC
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	PlanEx: Bridging Planning and Execution KnowSched: Knowledge Techniques in Scheduling
http://linked.open...UplatneniVysledku	2014
http://linked.open...v/svazekPeriodika	41
http://linked.open...iv/tvurceVysledku	Barták, Roman Rovenský, Vladimír
http://linked.open...ain/vavai/riv/wos	000328443900015
issn	0957-4174
number of pages	15 (xsd:int)
http://bibframe.org/vocab/doi	10.1016/j.eswa.2013.08.021
http://localhost/t...ganizacniJednotka	11320

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software