Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Rule randomisation and its application to logic-based workflow verification

Rule randomisation and its application to logic-based workflow verification Workflow verification has been a well-studied research topic during the past few years. Theorem proof-based approaches to workflow verification have become popular due to several advantages including being based on formal characterisation with rigorous and unambiguous inference mechanisms. However, a common problem with these inference mechanisms is combinatorial explosions, which forms a major performance hurdle to workflow verification systems based on inference. In this paper, we study how randomisation enables reuse and reduces processing time in logic-based workflow verification approaches. In particular, we look at a propositional logic-based workflow verification technique. For the logic inference rules, which are used to infer new truthful propositions from existing truthful propositions in this logic, we apply randomisation to the inference rules after each verification task such that new inference rules, reflecting the componentised verification, are added to the inference rule sets. We also review the savings gained by verifying a workflow pattern and provide a theoretical analysis. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Information and Decision Sciences Inderscience Publishers

Rule randomisation and its application to logic-based workflow verification

Loading next page...
 
/lp/inderscience-publishers/rule-randomisation-and-its-application-to-logic-based-workflow-FLHp0u3IQz
Publisher
Inderscience Publishers
Copyright
Copyright © Inderscience Enterprises Ltd. All rights reserved
ISSN
1756-7017
eISSN
1756-7025
DOI
10.1504/IJIDS.2009.027655
Publisher site
See Article on Publisher Site

Abstract

Workflow verification has been a well-studied research topic during the past few years. Theorem proof-based approaches to workflow verification have become popular due to several advantages including being based on formal characterisation with rigorous and unambiguous inference mechanisms. However, a common problem with these inference mechanisms is combinatorial explosions, which forms a major performance hurdle to workflow verification systems based on inference. In this paper, we study how randomisation enables reuse and reduces processing time in logic-based workflow verification approaches. In particular, we look at a propositional logic-based workflow verification technique. For the logic inference rules, which are used to infer new truthful propositions from existing truthful propositions in this logic, we apply randomisation to the inference rules after each verification task such that new inference rules, reflecting the componentised verification, are added to the inference rule sets. We also review the savings gained by verifying a workflow pattern and provide a theoretical analysis.

Journal

International Journal of Information and Decision SciencesInderscience Publishers

Published: Jan 1, 2009

There are no references for this article.