The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
Nested relations and complex objects in databases
Nested relations and complex objects in databases
The G+/GraphLog Visual Query System
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Efficient decision procedures for graph properties on context-free graph languages
Journal of the ACM (JACM)
Logic based programmed structure rewriting systems
Fundamenta Informaticae - Special issue on graph transformations
Linear and Context-Free Graph Grammars
Journal of the ACM (JACM)
Model checking
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Parameterized complexity for the database theorist
ACM SIGMOD Record
Model Checking for Context-Free Processes
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
The Subgraph Bisimulation Problem
IEEE Transactions on Knowledge and Data Engineering
XQuery: a query language for XML
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Context-sensitive program analysis as database queries
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Diagnosis of asynchronous discrete event systems: datalog to the rescue!
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Analysis of recursive state machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Querying business processes with BP-QL
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Verification of communicating data-driven web services
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Using partial evaluation in distributed query evaluation
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Type inference and type checking for queries on execution traces
Proceedings of the VLDB Endowment
Querying and monitoring distributed business processes
Proceedings of the VLDB Endowment
Querying web-based applications under models of uncertainty
Proceedings of the VLDB Endowment
TOP-K projection queries for probabilistic business processes
Proceedings of the 12th International Conference on Database Theory
On models and query languages for probabilistic processes
ACM SIGMOD Record
Querying contract databases based on temporal behavior
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Semantic business process space for intelligent management of sales order business processes
Information Systems Frontiers
A structural/temporal query language for Business Processes
Journal of Computer and System Sciences
Type inference and type checking for queries over execution traces
The VLDB Journal — The International Journal on Very Large Data Bases
Querying business process model repositories
World Wide Web
| Hi-index | 0.00 |
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.