Querying probabilistic business processes for sub-flows

DOI10.1007/S00224-012-9391-6MaRDI QIDQ359875zbMATHOpenAlexFDO

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

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)

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

Cites work

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

Cited in

(3)

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

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)