Rule Randomization for Propositional 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 become popular due to several advantages including being based on formal characterization with rigorous and non-ambiguous inference mechanisms. However, a c...

Full description

Saved in:
Bibliographic Details
Main Authors: LIANG, Qianhui (Althea), Rubin, S.
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2008
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/416
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.sis_research-1415
record_format dspace
spelling sg-smu-ink.sis_research-14152010-09-24T06:36:22Z Rule Randomization for Propositional Logic-Based Workflow Verification LIANG, Qianhui (Althea) Rubin, S. Workflow verification has been a well studied research topic during the past few years. Theorem proof based approaches to workflow verification become popular due to several advantages including being based on formal characterization with rigorous and non-ambiguous inference mechanisms. However, a common problem to 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 randomization enables reuse and reduces processing time in logic based workflow verification approaches. We, in particular, 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 randomization to the inference rules after each verification task such that new inference rules reflecting the componentized verification are added to the inference rule sets. We reviewed the savings incurred in verifying a workflow pattern and provide a theoretical analysis. 2008-06-01T07:00:00Z text https://ink.library.smu.edu.sg/sis_research/416 info:doi/10.1109/IRI.2008.4583060 Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Computer Sciences Management Information Systems
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Computer Sciences
Management Information Systems
spellingShingle Computer Sciences
Management Information Systems
LIANG, Qianhui (Althea)
Rubin, S.
Rule Randomization for Propositional Logic-Based Workflow Verification
description Workflow verification has been a well studied research topic during the past few years. Theorem proof based approaches to workflow verification become popular due to several advantages including being based on formal characterization with rigorous and non-ambiguous inference mechanisms. However, a common problem to 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 randomization enables reuse and reduces processing time in logic based workflow verification approaches. We, in particular, 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 randomization to the inference rules after each verification task such that new inference rules reflecting the componentized verification are added to the inference rule sets. We reviewed the savings incurred in verifying a workflow pattern and provide a theoretical analysis.
format text
author LIANG, Qianhui (Althea)
Rubin, S.
author_facet LIANG, Qianhui (Althea)
Rubin, S.
author_sort LIANG, Qianhui (Althea)
title Rule Randomization for Propositional Logic-Based Workflow Verification
title_short Rule Randomization for Propositional Logic-Based Workflow Verification
title_full Rule Randomization for Propositional Logic-Based Workflow Verification
title_fullStr Rule Randomization for Propositional Logic-Based Workflow Verification
title_full_unstemmed Rule Randomization for Propositional Logic-Based Workflow Verification
title_sort rule randomization for propositional logic-based workflow verification
publisher Institutional Knowledge at Singapore Management University
publishDate 2008
url https://ink.library.smu.edu.sg/sis_research/416
_version_ 1770570416233906176