Polynomial analysis algorithms for free choice probabilistic workflow nets

DOI10.1007/978-3-319-43425-4_6zbMath1383.90016arXiv1606.00175OpenAlexW2416287915MaRDI QIDQ1693120

Ratul Saha, Javier Esparza, Philipp H. W. Hoffmann

Publication date: 11 January 2018

Full work available at URL: https://arxiv.org/abs/1606.00175

zbMATH Keywords

Markov decision processesprobabilistic workflow nets

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36) Markov and semi-Markov decision processes (90C40)

Related Items (3)

Out of control: reducing probabilistic models by control-state elimination ⋮ PSPACE-Completeness of the Soundness Problem of Safe Asymmetric-Choice Workflow Nets ⋮ Negotiation as concurrency primitive

This page was built for publication: Polynomial analysis algorithms for free choice probabilistic workflow nets