A structural/temporal query language for Business Processes

Journal of Computer and System Sciences

Volumn 78, Issue 2, 2012, Pages 583-609

  Deutch, Daniel ^a   Milo, Tova ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Business Processes; Query languages

Indexed keywords

PETROLEUM RESERVOIR EVALUATION; QUERY LANGUAGES;

ASYMPTOTICALLY OPTIMAL; BUSINESS ACTIVITIES; BUSINESS PROCESS; DISTRIBUTED ENVIRONMENTS; POLYNOMIAL DATA; PROCESS SPECIFICATION; QUERY EVALUATION ALGORITHM; TEMPORAL QUERIES;

PROGRAM DEBUGGING;

EID: 84856006510     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2011.09.004     Document Type: Article

References (34)

1. R. Alur, M. Benedikt, K. Etessami, P. Godefroid, T. Reps, and M. Yannakakis Analysis of recursive state machines ACM Trans. Program. Lang. Syst. 27 4 2005
2. R. Alur, S. Chaudhuri, P. Madhusudan, A fixpoint calculus for local and global program flows, in: Proc. of POPL, 2006.
3. C. Beeri, A. Eyal, S. Kamenkovich, T. Milo, Querying business processes with BP-QL (demo), in: Proc. of VLDB, 2005.
4. C. Beeri, A. Eyal, S. Kamenkovich, T. Milo, Querying business processes, in: Proc. of VLDB, 2006.
5. C. Beeri, A. Eyal, S. Kamenkovich, T. Milo, Monitoring business processes with queries, in: Proc. of VLDB, 2007.
6. M. Benedikt, P. Godefroid, T. Reps, Model checking of unrestricted hierarchical state machines, in: Proc. of ICALP, 2001.
7. Business Process Execution Language for Web Services http://www.ibm.com/ developerworks/library/ws-bpel/
8. P. Buneman, G. Cong, W. Fan, A. Kementsietsidis, Using partial evaluation in distributed query evaluation, in: Proc. of VLDB, 2006.
9. E.M. Clarke, O. Grumberg, and D.A. Peled Model Checking 1999 MIT Press
10. B. Courcelle The monadic second-order logic of graphs Inform. and Comput. 85 1 1990
11. B. Courcelle Recognizable sets of graphs, hypergraphs and relational structures: a survey DLT 04 LNCS vol. 3340 2004
12. D. Deutch, T. Milo, Querying structural and behavioral properties of business processes, in: Proc. of DBPL, 2007.
13. D. Deutch, T. Milo, Type inference and type checking for queries on execution traces, in: Proc. of VLDB, 2008.
14. D. Deutch, T. Milo, Evaluating top-k queries over business processes, in: Proc. of ICDE, 2009.
15. A. Deutsch, L. Sui, V. Vianu, D. Zhou, Verification of communicating data-driven web services, in: Proc. of PODS, 2006.
16. A. Dovier, and C. Piazza The subgraph bisimulation problem IEEE Trans. Knowl. Data Eng. 15 4 2003
17. R.G. Downey, and M.R. Fellows Fixed-parameter tractability and completeness II: On completeness for W [ 1 ] Theoret. Comput. Sci. 1995
18. R.G. Downey, and M.R. Fellows Parameterized Complexity 1999 Springer
19. E.A. Emerson Temporal and modal logic J. van Leeuwen, Handbook of Theoretical Computer Science, vol. B: Formal Models and Semantics 1990 Elsevier
20. M. Frick, and M. Grohe The complexity of first-order and monadic second-order logic revisited LICS 02 2002 IEEE Computer Society Washington, DC 215 224
21. M.R. Garey, and D.S. Johnson Computer and Intractability: A Guide to the Theory of NP-Completeness 1979 W.H. Freeman
22. G. Gottlob, C. Koch, and R. Pichler Xpath processing in a nutshell SIGMOD Rec. 32 2 2003
23. D. Janin, I. Walukiewicz, On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic, in: Proc. of CONCUR, 1996.
24. D. Janssens, G. Rozenberg, Graph grammars with node-label controlled rewriting and embedding, in: Proc. of COMPUGRAPH, 1983.
25. M.S. Lam, J. Whaley, V.B. Livshits, M.C. Martin, D. Avots, M. Carbin, C. Unkel, Context-sensitive program analysis as database queries, in: Proc. of PODS, 2005.
26. T. Lengauer, and E. Wanke Efficient decision procedures for graph properties on context-free graph languages J. ACM 40 2 1993
27. J.E. Mezei, and J.B. Wright Algebraic automata and context-free sets Proc. of the Conference on the Algebraic Theory of Machines, Languages, and Semigroups Information and Control 11 1967
28. G. Nelson, and D.C. Oppen Simplification by cooperating decision procedures ACM Trans. Program. Lang. Syst. 1 2 1979
29. Oracle BPEL Process Manager 2.0 Quick Start Tutorial http://www.oracle. com/technology/products/ias/bpel/index.html
30. C.H. Papadimitriou, and M. Yannakakis On the complexity of database queries (extended abstract) PODS 97: Proceedings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems 1997 ACM Press New York, NY 12 19
31. T. Pavlidis Linear and context-free graph grammars J. ACM 19 1 1972
32. A. Schurr Logic based programmed structure rewriting systems Fund. Inform. 26 3-4 1996
33. M. Sipser Introduction to the Theory of Computation 1997 PWS Publishing Company
34. B. Trakhtenbrot Impossibility of an algorithm for the decision problem in finite classes Dokl. Akad. Nauk SSSR 70 1950