2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.LO2016★ 2 cited
Polynomial Analysis Algorithms for Free Choice Probabilistic Workflow Nets
Javier Esparza, Philipp Hoffmann, Ratul Saha
We study Probabilistic Workflow Nets (PWNs), a model extending van der Aalst's workflow nets with probabilities. We give a semantics for PWNs in terms of Markov Decision Processes…
cs.DC2014
Distributed Markov Chains
Sumit Kumar Jha, Madhavan Mukund, Ratul Saha +1
The formal verification of large probabilistic models is important and challenging. Exploiting the concurrency that is often present is one way to address this problem. Here we stu…