An action-based approach to the formal specification and automatic analysis of business processes under authorization constraints

被引:7
作者
Armando, Alessandro [1 ,2 ]
Giunchiglia, Enrico [1 ]
Maratea, Marco [1 ]
Ponta, Serena Elisa [1 ,3 ]
机构
[1] Univ Genoa, DIST, Genoa, Italy
[2] Fdn Bruno Kessler, Secur & Trust Unit, Trento, Italy
[3] SAP Res Sophia Antipolis, Mougins, France
关键词
Knowledge representation and reasoning; Action languages; Business processes; REPRESENTING ACTION; DOMAINS;
D O I
10.1016/j.jcss.2011.02.015
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Business processes under authorization control are sets of coordinated activities subject to a security policy stating which agent can access which resource. Their behavior is difficult to predict due to the complex and unexpected interleaving of different execution flows within the process. Serious flaws may thus go undetected and manifest themselves only after deployment. For this reason, business processes are being considered a new, promising application domain for formal methods and model checking techniques in particular. In this paper we show that action-based languages provide a rich and natural framework for the formal specification of and automated reasoning about business processes under authorization constraints. We do this by discussing the application of the action language C to the specification of a business process from the banking domain that is representative of an important class of business processes of practical relevance. Furthermore we show that a number of reasoning tasks that arise in this context (namely checking whether the control flow together with the security policy meets the expected security properties, building a security policy for the given business process under given security requirements, and finding an allocation of tasks to agents that guarantees the completion of the business process) can be carried out automatically using the Causal Calculator CCALC. We also compare C with the prominent specification language used in model-checking.(1) (C) 2011 Elsevier Inc. All rights reserved.
引用
收藏
页码:119 / 141
页数:23
相关论文
共 56 条
[1]   Representing the Zoo World and the Traffic World in the language of the causal calculator [J].
Akman, V ;
Erdogan, ST ;
Lee, J ;
Lifschitz, V ;
Turner, H .
ARTIFICIAL INTELLIGENCE, 2004, 153 (1-2) :105-140
[2]  
[Anonymous], BUS PROC MOD NOT BPM
[3]  
ANTONIOU G, 2007, ADV INFORM SECURITY, V33, P169
[4]  
Armando A, 2009, LECT NOTES COMPUT SC, V5695, P63, DOI 10.1007/978-3-642-03748-1_7
[5]  
Arsac W, 2011, LECT NOTES COMPUT SC, V6542, P29, DOI 10.1007/978-3-642-19125-1_3
[6]  
Atluri V., 2005, Proceedings of the 10th ACM symposium on Access control models and technologies. SACMAT '05, P49, DOI DOI 10.1145/1063979.1063990
[7]   Reasoning about effects of concurrent actions [J].
Baral, C ;
Gelfond, M .
JOURNAL OF LOGIC PROGRAMMING, 1997, 31 (1-3) :85-117
[8]  
Baral C., 2003, Knowledge Representation, Reasoning and Declarative Problem Solving
[9]   Modeling Multi-agent Domains in an Action Languages: An Empirical Study Using C [J].
Baral, Chitta ;
Son, Tran Cao ;
Pontelli, Enrico .
LOGIC PROGRAMMING AND NONMONOTONIC REASONING, PROCEEDINGS, 2009, 5753 :409-+
[10]  
BONATTI PA, 2007, LNCS, V4636, P240