Cart (Loading....) | Create Account
Close category search window
 

Research of Graph-Based Workflow Access Control

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yonghe Wei ; R&D Center of CAD/CAM Technol., Shenyang Ligong Univ., Shenyang, China ; Chunjing Shi

Using graph transformation as a formalism to specify access control has several advantages, from the intuition provided by the visual aspect to the precise semantics and the systematic verification of constraints. Graph transformations provide a uniform and precise framework for the specification of access control policies. This article presents specification formalisms for workflow access control policies using graph transformation. The authorization states are represented by graphs and state transition by 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. 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 formal properties of graph transformation, it is can to detect inconsistencies between a rules and a constraint and lay the foundation for their resolutions. We present an algorithm to automatically check and eliminate conflicts between rules and positive and negative constraints.

Published in:

Computer Science and Computational Technology, 2008. ISCSCT '08. International Symposium on  (Volume:2 )

Date of Conference:

20-22 Dec. 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.