Pages that link to "Item:Q1693120"
From MaRDI portal
The following pages link to Polynomial analysis algorithms for free choice probabilistic workflow nets (Q1693120):
Displaying 4 items.
- Negotiation as concurrency primitive (Q1731828) (← links)
- Out of control: reducing probabilistic models by control-state elimination (Q2152665) (← links)
- PSPACE-Completeness of the Soundness Problem of Safe Asymmetric-Choice Workflow Nets (Q5100757) (← links)
- Advances in quantitative analysis of free-choice workflow Petri nets (invited talk) (Q6486416) (← links)