Rule randomisation and its application to logic-based workflow verification
by Qianhui Liang, Stuart H. Rubin
International Journal of Information and Decision Sciences (IJIDS), Vol. 1, No. 3, 2009

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.

Online publication date: Thu, 06-Aug-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Decision Sciences (IJIDS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com