Querying probabilistic business processes for sub-flows

DOI10.1007/s00224-012-9391-6zbMath1270.68231OpenAlexW2022911989MaRDI QIDQ359875

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

probabilistic modelsbusiness processesprojection queries

Mathematics Subject Classification ID

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

Related Items

Querying probabilistic business processes for sub-flows

Cites Work

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