Querying probabilistic business processes for sub-flows

DOI10.1007/S00224-012-9391-6zbMATH Open1270.68231OpenAlexW2022911989MaRDI QIDQ359875FDOQ359875

Authors: Daniel Deutch 

Publication date: 23 August 2013

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-012-9391-6

Recommendations

• A structural/temporal query language for business processes
• Probabilistic simulation for probabilistic data-aware business processes
• Business processes. A database perspective.
• Query stability in monotonic data-aware business processes
• Probabilistic model checking of BPMN processes at runtime

zbMATH Keywords

business processesprobabilistic modelsprojection queries

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Analysis of algorithms (68W40) Data structures (68P05) Knowledge representation (68T30)

Cites Work

• Markov chains and stochastic stability
• COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
• Title not available (Why is that?)
• Constructing roadmaps of semi-algebraic sets. I: Completeness
• On the principle of inclusion and exclusion
• Querying probabilistic business processes for sub-flows
• Title not available (Why is that?)
• Model Checking Probabilistic Pushdown Automata
• STACS 2005
• Languages and Compilers for Parallel Computing
• The monadic second-order logic of graphs. IV: Definability properties of equational graphs

Cited In (3)

• Probabilistic simulation for probabilistic data-aware business processes
• Query stability in monotonic data-aware business processes
• Querying probabilistic business processes for sub-flows

This page was built for publication: Querying probabilistic business processes for sub-flows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q359875)