A deductive system for proving workflow models from operational procedures
详细信息 查看全文
- 作者：Rune Rasmussen ; r.rasmussen@qut.edu.au ; [Author Vitae] ; Ross Brown r.brown@qut.edu.au ; [Author Vitae]
- 关键词：Workflow ; Planning ; Petri-net ; Automation ; Management ; Modelling
- 刊名：Future Generation Computer Systems
- 出版年：2012
- 出版时间：May, 2012
- 年：2012
- 卷：28
- 期：5
- 页码：732-742
- 全文大小：960 K
文摘
Many modern business environments employ software to automate the delivery of workflows; whereas, workflow design and generation remains a laborious technical task for domain specialists. Several different approaches have been proposed for deriving workflow models. Some approaches rely on process data mining approaches, whereas others have proposed derivations of workflow models from operational structures, domain specific knowledge or workflow model compositions from knowledge-bases. Many approaches draw on principles from automatic planning, but conceptual in context and lack mathematical justification. In this paper we present a mathematical framework for deducing tasks in workflow models from plans in mechanistic or strongly controlled work environments, with a focus around automatic plan generations. In addition, we prove an associative composition operator that permits crisp hierarchical task compositions for workflow models through a set of mathematical deduction rules. The result is a logical framework that can be used to prove tasks in workflow hierarchies from operational information about work processes and machine configurations in controlled or mechanistic work environments.