摘要：We survey recent results on the development of efficient algorithms for the quantitative analysis of business processes modeled as workflow Petri nets. The algorithms can be applied to any workflow net, but have polynomial runtime in the free-choice case.
关键词：Free-choice Petri Nets; concurrency theory; quantitative verification
