Graph Transformations for the Specification of Access Control in Workflow

The administration of access control in a organization is a complex task. To ensure that tasks constituting the business processes are performed by authorized users, a proper access control mechanism is required. Graph transformations provide a uniform and precise framework for the specification of access control policies. After reviewing the basic notations of graph transformation, this article presents specification formalisms for workflow access control policies using graph transformation. The proposed formalization provides an intuitive description for the manipulation of graph structures as they occur in workflow access control and a precise specification of consistency conditions on graphs and graph transformations. In this paper we specifies a type graph to represents the type information in the graph transformation for workflow access control, a set of rules to build the system states and sets of positive and negative constraints to specify wanted and unwanted framework. Using termination which a formal properties of graph transformation we discuss the reachable of workflow authorization.