工作流弹性的结果:复杂性、新公式和ASP编码
Results in Workflow Resiliency: Complexity, New Formulation, and ASP Encoding
摘要:
Wang和Li在2007年首次提出,工作流弹性是一种策略分析,用于确保即使在对抗性环境中从服务中删除一部分工作人员,工作流仍然可以被实例化以满足所有安全约束。Wang和Li提出了三种工作流弹性的概念:静态弹性、递减弹性和动态弹性。虽然递减弹性和动态弹性都是PSPACE完备的,但Wang和Li没有为静态弹性的复杂性提供匹配的下限和上限。目前的工作首先证明静态弹性是$Π_2^p$ -完整的,从而弥合了长期存在的复杂性差距的文献。此外,第四个概念的工作流弹性,一次性弹性,提出并示出保持在第三层次的多项式。这表明复杂的工作流弹性概念不需要是PSPACE完整的。最后,我们演示了如何减少静态和一次性弹性的答案集编程(ASP),现代约束求解技术,可用于解决推理任务的多项式层次结构的较低水平。总之,这项工作证明了专注于驻留在多项式层次结构的较低级别的工作流弹性的概念的价值。
英文摘要:
First proposed by Wang and Li in 2007, workflow resiliency is a policy analysis for ensuring that, even when an adversarial environment removes a subset of workers from service, a workflow can still be instantiated to satisfy all the security constraints. Wang and Li proposed three notions of workflow resiliency: static, decremental, and dynamic resiliency. While decremental and dynamic resiliency are both PSPACE-complete, Wang and Li did not provide a matching lower and upper bound for the complexity of static resiliency. The present work begins with proving that static resiliency is $Π_2^p$-complete, thereby bridging a long-standing complexity gap in the literature. In addition, a fourth notion of workflow resiliency, one-shot resiliency, is proposed and shown to remain in the third level of the polynomial hierarchy. This shows that sophisticated notions of workflow resiliency need not be PSPACE-complete. Lastly, we demonstrate how to reduce static and one-shot resiliency to Answer Set Programming (ASP), a modern constraint-solving technology that can be used for solving reasoning tasks in the lower levels of the polynomial hierarchy. In summary, this work demonstrates the value of focusing on notions of workflow resiliency that reside in the lower levels of the polynomial hierarchy.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。