Provided by: Association for Computing Machinery
In order to provide certified security services the authors must provide indicators that can measure the level of assurance that a complex business process can offer. Unfortunately the formulation of security indicators is not amenable to efficient algorithms able to evaluate the level of assurance of complex process from its components. In this paper they show an algorithm based on FD-graphs (a variant of directed hyper-graphs) that can be used to compute in polynomial time, the overall assurance indicator of a complex business process from its components for arbitrary monotone composition functions and the subpart of the business process that is responsible for such assurance indicator (i.e. the best security alternative).