2 citations · 2 across the 5 of their papers we have counts for
Showing 2016 · cs.LOShow all
3 papers · 2 filters
cs.LO2016
Negotiation as Concurrency Primitive
Joerg Desel, Javier Esparza, Philipp Hoffmann
This paper introduces negotiations, a model of concurrency close to Petri nets, with multi-party negotiations as concurrency primitive. We study two fundamental analysis problems.…
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.LO2016
Reduction Rules for Colored Workflow Nets
Javier Esparza, Philipp Hoffmann
We study Colored Workflow nets, a model based on Workflow nets enriched with data. Based on earlier work by Esparza and Desel[arXiv:1307.2145,arXiv:1403.4958] on the negotiation mo…