[1] AALST W,HEE K.Workflow Management:Models,Methods and Systems[M].Massachusetts,USA:MIT Press, 2004.
[2] 翟治年,卢亚辉,奚建清,等.面向企业级流程的职责分离框架及其冗余分析[J].电子学报,2013,41(10):2087-2093. ZHAI Z,LU Y,XI J,et al.Enterprise-level business process oriented framework for separation of duties with its redundancy analysis[J].Acta Electronica Sinica,2013,41(10):2087-2093.(in Chinese)
[3] WANG Q,Li N.Satisfiability and resiliency in workflow authorization systems[J].ACM Transactions on Information and System Security,2010,13(4):1-35.
[4] BERTINO E,FERRARI E,ATLURI V.The specification and enforcement of authorization constraints in workflow management systems[J].ACM Transactions on Information System Security,1999,2(1):65-104.
[5] CRAMPTON J,GUTIN G,YEO A.On the parameterized complexity and kernelization of the workflow satisfiability problem[J].ACM Transactions on Information and System Security,2013,16(1):1-31.
[6] ATLURI V,BERTINO E,FERRARI E,et al.Supporting delegation in secure workflow management systems[A].17th Annual Conference on Data and Application of Security[C].Berlin,GER:Springer,2003.190-202.
[7] CRAMPTON J,KHAMBHAMMETTU H.Delegation and satisfiability in workflow systems[A].13th ACM Symposium on Access Control Models and Technologies[C].NY,USA:ACM,2008.31-40.
[8] BASIN D,BURRI S,KARJOTH G.Obstruction-free authorization enforcement:aligning security and business objectives[A].Computer Security Foundations Symposium[C].WA,USA:IEEE CS,2011.99-113.
[9] 赵相福,欧阳丹彤.使用SAT求解器产生所有极小冲突部件集[J].电子学报,2009,37(4):804-810. ZHAO X,OUYANG D.Deriving all minimal conflict sets using satisfiability algorithms[J].Acta Electronica Sinica,2009,37(4):804-810.(in Chinese)
[10] VALIANT L.The complexity of computing the permanent[J].Theoretical Computer Science,1979,8(2):189-201.
[11] VALIANT L.The complexity of enumeration and reliability problems[J].SIAM Journal on Computing,1979,8(3):410-421.
[12] DAHLLÖF V,JONSSON P,WAHLSTRÖM M.Counting models for 2sat and 3sat formulae[J].Theoretical Computer Science,2005,332(1-3):265-291.
[13] BULATOV A.The complexity of the counting constraint satisfaction problem[J].Journal of the ACM,2013,60(345):1-29.
[14] VADHAN S P.The Complexity of Counting[D].MA,USA:Harvard University,1995. |