Document Open Access Logo

Advances in Quantitative Analysis of Free-Choice Workflow Petri Nets (Invited Talk)

Author Javier Esparza

PDF
Thumbnail PDF

File

LIPIcs.TIME.2017.2.pdf
  • Filesize: 354 kB
  • 6 pages

Document Identifiers

Author Details

Javier Esparza

Cite AsGet BibTex

Javier Esparza. Advances in Quantitative Analysis of Free-Choice Workflow Petri Nets (Invited Talk). In 24th International Symposium on Temporal Representation and Reasoning (TIME 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 90, pp. 2:1-2:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
https://doi.org/10.4230/LIPIcs.TIME.2017.2

Abstract

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.
Keywords
  • Free-choice Petri Nets
  • concurrency theory
  • quantitative verification

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. Wil van der Aalst. The application of Petri nets to workflow management. Journal of Circuits, Systems, and Computers, 8(1):21-66, 1998. Google Scholar
  2. Wil van der Aalst and Kees Max van Hee. Workflow management: models, methods, and systems. MIT press, 2004. Google Scholar
  3. Wil van der Aalst, Alexander Hirnschall, and Eric Verbeek. An alternative way to analyze workflow graphs. In Advanced Information Systems Engineering, volume 2348 of Lecture Notes in Computer Science, pages 535-552. Springer, 2002. Google Scholar
  4. Mirela Botezatu, Hagen Völzer, and Lothar Thiele. The complexity of deadline analysis for workflow graphs with multiple resources. In BPM, volume 9850 of Lecture Notes in Computer Science, pages 252-268. Springer, 2016. Google Scholar
  5. Jörg Desel and Thomas Erwin. Modeling, simulation and analysis of business processes. In Business Process Management, volume 1806 of Lecture Notes in Computer Science, pages 129-141. Springer, 2000. Google Scholar
  6. Jörg Desel and Javier Esparza. Free choice Petri nets. Cambridge University Press, 2005. Google Scholar
  7. Jörg Desel and Javier Esparza. Negotiations and Petri nets. Transactions in Petri Nets and Other Models of Concurrency, 11:203-225, 2016. Google Scholar
  8. Jörg Desel, Javier Esparza, and Philipp Hoffmann. Negotiation as concurrency primitive. CoRR, abs/1612.07912, 2016. Google Scholar
  9. Boudewijn van Dongen, Wil van der Aalst, and Eric Verbeek. Verification of EPCs: Using reduction rules and Petri nets. In Advanced Information Systems Engineering, pages 372-386. Springer, 2005. Google Scholar
  10. Christian Eisentraut, Holger Hermanns, Joost-Pieter Katoen, and Lijun Zhang. A semantics for every GSPN. In PETRI NETS, volume 7927 of Lecture Notes in Computer Science, pages 90-109. Springer, 2013. Google Scholar
  11. Javier Esparza and Jörg Desel. On negotiation as concurrency primitive. In CONCUR, volume 8052 of Lecture Notes in Computer Science, pages 440-454. Springer, 2013. Google Scholar
  12. Javier Esparza and Jörg Desel. On negotiation as concurrency primitive II: Deterministic cyclic negotiations. In FoSSaCS, volume 8412 of Lecture Notes in Computer Science, pages 258-273. Springer, 2014. Google Scholar
  13. Javier Esparza and Philipp Hoffmann. Reduction rules for colored workflow nets. In FASE, volume 9633 of Lecture Notes in Computer Science, pages 342-358, 2016. Google Scholar
  14. Javier Esparza, Philipp Hoffmann, and Ratul Saha. Polynomial analysis algorithms for free choice probabilistic workflow nets. In QEST, volume 9826 of Lecture Notes in Computer Science, pages 89-104. Springer, 2016. Google Scholar
  15. Javier Esparza, Anca Muscholl, and Igor Walukiewicz. Static analysis of deterministic negotiations. CoRR, abs/1704.04190, 2017. To appear in the Proceedings of LICS'17. Google Scholar
  16. Dirk Fahland, Cédric Favre, Barbara Jobstmann, Jana Koehler, Niels Lohmann, Hagen Völzer, and Karsten Wolf. Instantaneous soundness checking of industrial business process models. In BPM, volume 5701 of Lecture Notes in Computer Science, pages 278-293. Springer, 2009. Google Scholar
  17. Cédric Favre, Dirk Fahland, and Hagen Völzer. The relationship between workflow graphs and free-choice workflow nets. Information Systems, 47:197-219, 2015. Google Scholar
  18. Cédric Favre, Hagen Völzer, and Peter Müller. Diagnostic information for control-flow analysis of Workflow Graphs (a.k.a. Free-Choice Workflow nets). In TACAS, volume 9636 of Lecture Notes in Computer Science, pages 463-479, 2016. Google Scholar
  19. Joost-Pieter Katoen. GSPNs revisited: Simple semantics and new analysis algorithms. In ACSD, pages 6-11. IEEE Computer Society, 2012. Google Scholar
  20. Flemming Nielson, Hanne Riis Nielson, and Chris Hankin. Principles of program analysis. Springer, 1999. Google Scholar
  21. Wasim Sadiq and Maria E. Orlowska. Analyzing process models using graph reduction techniques. Information systems, 25(2):117-134, 2000. Google Scholar
  22. Karsten Schmidt. LoLA: A low level analyser. In ICATPN, volume 1825 of Lecture Notes in Computer Science, pages 465-474, 2000. Current version available at URL: http://www.service-technology.org.
  23. Nikola Trcka, Wil M. P. van der Aalst, and Natalia Sidorova. Data-flow anti-patterns: Discovering data-flow errors in workflows. In CAiSE 2009, volume 5565 of Lecture Notes in Computer Science, pages 425-439, 2009. Google Scholar
  24. Eric Verbeek, Moe Thandar Wynn, Wil van der Aalst, and Arthur ter Hofstede. Reduction rules for reset/inhibitor nets. Journal of Computer and System Sciences, 76(2):125-143, 2010. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact