The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
The complexity of probabilistic verification
Journal of the ACM (JACM)
Complexity and real computation
Complexity and real computation
Linear and Context-Free Graph Grammars
Journal of the ACM (JACM)
Some NP-complete geometric problems
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
XQuery: a query language for XML
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
A verifier for interactive, data-driven web applications
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Analysis of recursive state machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Tools for composite web services: a short overview
ACM SIGMOD Record
Verification of communicating data-driven web services
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
On the complexity of managing probabilistic XML data
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Matching twigs in probabilistic XML
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
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
Journal of the ACM (JACM)
Automatic construction of simple artifact-based business processes
Proceedings of the 12th International Conference on Database Theory
TOP-K projection queries for probabilistic business processes
Proceedings of the 12th International Conference on Database Theory
Evaluating TOP-K Queries over Business Processes
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
On the expressiveness of probabilistic XML models
The VLDB Journal — The International Journal on Very Large Data Bases
Goal-oriented web-site navigation for on-line shoppers
Proceedings of the VLDB Endowment
Querying structural and behavioral properties of business processes
DBPL'07 Proceedings of the 11th international conference on Database programming languages
Aggregate queries for discrete and continuous probabilistic XML
Proceedings of the 13th International Conference on Database Theory
On the aggregation problem for synthesized web services
Proceedings of the 13th International Conference on Database Theory
Probabilistic XML via Markov Chains
Proceedings of the VLDB Endowment
Optimal top-k query evaluation for weighted business processes
Proceedings of the VLDB Endowment
Querying and updating probabilistic information in XML
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
On the decidability of temporal properties of probabilistic pushdown automata
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Algorithmic verification of recursive probabilistic state machines
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
| Hi-index | 0.00 |
Probabilistic processes appear naturally in various contexts, with applications to Business Processes, XML data management and more. Many models for specifying and querying such processes exist in the literature; a main goal of research in this area is to design models that are expressive enough to capture real-life processes and analysis tasks, but at the same time allow for efficient query evaluation. We depict the model established in [13, 16, 17, 18], and claim that it achieves a good balance between expressivity and query evaluation complexity. We compare and contrast the model with other common models for probabilistic processes, highlighting the different choices made in models design and their effect on expressivity and incurred complexity.