Handbook of theoretical computer science (vol. B)
Efficient decision procedures for graph properties on context-free graph languages
Journal of the ACM (JACM)
Fixed-parameter tractability and completeness II: on completeness for W[1]
Theoretical Computer Science
Logic based programmed structure rewriting systems
Fundamenta Informaticae - Special issue on graph transformations
On the complexity of database queries (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Linear and Context-Free Graph Grammars
Journal of the ACM (JACM)
Model checking
Simplification by Cooperating Decision Procedures
ACM Transactions on Programming Languages and Systems (TOPLAS)
Introduction to the Theory of Computation
Introduction to the Theory of Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Complexity of First-Order and Monadic Second-Order Logic Revisited
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Model Checking of Unrestricted Hierarchical State Machines
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
XPath processing in a nutshell
ACM SIGMOD Record
The Subgraph Bisimulation Problem
IEEE Transactions on Knowledge and Data Engineering
Context-sensitive program analysis as database queries
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
A fixpoint calculus for local and global program flows
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
Monitoring business processes with queries
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Type inference and type checking for queries on execution traces
Proceedings of the VLDB Endowment
Evaluating TOP-K Queries over Business Processes
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Querying structural and behavioral properties of business processes
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Recognizable sets of graphs, hypergraphs and relational structures: a survey
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Search and result presentation in scientific workflow repositories
Proceedings of the 25th International Conference on Scientific and Statistical Database Management
Hi-index | 0.00 |
A Business Process consists of multiple business activities, which, when combined in a flow, achieve some particular goal. These processes usually operate in a distributed environment and the software implementing them is fairly complex. Thus, effective tools for analysis of the possible executions of such processes are extremely important for companies (Beeri et al., 2006, 2007 [4,5]); (Deutch and Milo, 2008 [13]); these tools can allow to debug and optimize the processes, and to make an optimal use of them. The goal of the present paper is to consider a formal model underlying Business Processes and study query languages over such processes. We study in details the relationship of the proposed model with previously suggested formalisms for processes modeling and querying. In particular we propose a query evaluation algorithm of polynomial data complexity that can be applied uniformly to two kind of common queries over processes, namely queries on the structure of the process specification as well as temporal queries on the potential behavior of the defined process. We show that unless P=NP the efficiency of our algorithm is asymptotically optimal.