loading
Papers Papers/2020

Research.Publish.Connect.

Paper

Paper Unlock

Author: Roman Barták

Affiliation: Charles University in Prague, Czech Republic

ISBN: 978-989-8425-95-9

ISSN: 2184-433X

Keyword(s): Workflow, Verification, Complexity, Scheduling.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Constraint Satisfaction ; Formal Methods ; Industrial Applications of AI ; Informatics in Control, Automation and Robotics ; Intelligent Control Systems and Optimization ; Planning and Scheduling ; Simulation and Modeling ; Soft Computing ; Symbolic Systems

Abstract: Workflow is a formal description of a process or processes. There exist tools for interactive and visual editing of workflows such as the FlowOpt Workflow Editor. During manual editing of workflows, it is common to introduce flaws such as cycles of activities. Hence one of the required features of workflow management tools is verification of workflows, which is a problem of deciding whether the workflow describes processes that can be realized in practice. In this paper we deal with the theoretical complexity of verifying workflows with a nested structure and with extra constraints. The nested structure forces users to create valid workflows but as we shall show, introduction of extra causal, precedence, and temporal synchronization constraints makes the problem of deciding whether the workflow represents a realizable process hard. In particular, we will show that this problem is NP-complete.

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.238.249.17

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Barták, R. (2012). ON COMPLEXITY OF VERIFYING NESTED WORKFLOWS WITH EXTRA CONSTRAINTS.In Proceedings of the 4th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-8425-95-9, pages 346-354. DOI: 10.5220/0003748003460354

@conference{icaart12,
author={Roman Barták.},
title={ON COMPLEXITY OF VERIFYING NESTED WORKFLOWS WITH EXTRA CONSTRAINTS},
booktitle={Proceedings of the 4th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2012},
pages={346-354},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003748003460354},
isbn={978-989-8425-95-9},
}

TY - CONF

JO - Proceedings of the 4th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - ON COMPLEXITY OF VERIFYING NESTED WORKFLOWS WITH EXTRA CONSTRAINTS
SN - 978-989-8425-95-9
AU - Barták, R.
PY - 2012
SP - 346
EP - 354
DO - 10.5220/0003748003460354

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.