TY - GEN
T1 - Querying structural and behavioral properties of business processes
AU - Deutch, Daniel
AU - Milo, Tova
PY - 2007/1/1
Y1 - 2007/1/1
N2 - BPQL is a novel query language for querying business process specifications, introduced recently in [5,6]. It is based on an intuitive model of business processes as rewriting systems, an abstraction of the emerging BPEL (Business Process Execution Language) standard [7]. BPQL allows users to query business processes visually, in a manner very analogous to the language used to specify the processes. The goal of the present paper is to study the formal model underlying BPQL and investigate its properties as well as the complexity of query evaluation. We also study its relationship to previously suggested formalisms for process modeling and querying. In particular we propose a query evaluation algorithm of polynomial data complexity that can be applied uniformly to queries on the structure of the process specification as well as on the potential behavior of the defined process. We show that unless P=NP the efficiency of our algorithm is asymptotically optimal.
AB - BPQL is a novel query language for querying business process specifications, introduced recently in [5,6]. It is based on an intuitive model of business processes as rewriting systems, an abstraction of the emerging BPEL (Business Process Execution Language) standard [7]. BPQL allows users to query business processes visually, in a manner very analogous to the language used to specify the processes. The goal of the present paper is to study the formal model underlying BPQL and investigate its properties as well as the complexity of query evaluation. We also study its relationship to previously suggested formalisms for process modeling and querying. In particular we propose a query evaluation algorithm of polynomial data complexity that can be applied uniformly to queries on the structure of the process specification as well as on the potential behavior of the defined process. We show that unless P=NP the efficiency of our algorithm is asymptotically optimal.
UR - http://www.scopus.com/inward/record.url?scp=38449113336&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-75987-4_12
DO - 10.1007/978-3-540-75987-4_12
M3 - Conference contribution
AN - SCOPUS:38449113336
SN - 9783540759867
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 169
EP - 185
BT - Database Programming Languages - 11th International Symposium, DBPL 2007, Revised Selected Papers
PB - Springer Verlag
T2 - 11th International Symposium on Database Programming Languages, DBPL 2007
Y2 - 23 September 2007 through 24 September 2007
ER -