Skip to main content
SpringerLink
Log in

The Biconnected Verification of Workflow Nets

  • Conference paper
On the Move to Meaningful Internet Systems: OTM 2010 (OTM 2010)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6426))

Abstract

Formal representations of business processes are used for analysis of the process behavior. Workflow nets are a widely used formalism for describing the behavior of business processes. Structure theory of processes investigates the relation between the structure of a model and its behavior. In this paper, we propose to employ the connectivity property of workflow nets as an angle to their structural analysis. In particular, we show how soundness verification can be organized using biconnected components of a workflow net. This allows for efficient identification and localization of flaws in the behavior of workflow nets and for supporting process analysts with diagnostic information.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Lohmann, N.: A feature-complete Petri net semantics for WS-BPEL 2.0. In: Dumas, M., Heckel, R. (eds.) WS-FM 2007. LNCS, vol. 4937, pp. 77–91. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  2. Eshuis, R., Wieringa, R.: Tool support for verifying UML activity diagrams. IEEE Trans. Software Eng. 30(7), 437–447 (2004)

    Article  Google Scholar 

  3. Aalst, W.: Verification of workflow nets. In: Azéma, P., Balbo, G. (eds.) ICATPN 1997. LNCS, vol. 1248, pp. 407–426. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  4. Aalst, W.: The application of Petri nets to workflow management. Journal of Circuits, Systems, and Computers 8(1), 21–66 (1998)

    Article  Google Scholar 

  5. Hopcroft, J., Tarjan, R.: Algorithm 447: efficient algorithms for graph manipulation. ACM Commun. 16(6), 372–378 (1973)

    Article  Google Scholar 

  6. Murata, T.: Petri nets: Properties, analysis and applications. Proceedings of the IEEE 77(4), 541–580 (1989)

    Article  Google Scholar 

  7. Valette, R.: Analysis of petri nets by stepwise refinements. J. Comput. Syst. Sci. 18(1), 35–46 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  8. Aalst, W.: Workflow verification: Finding control-flow errors using petri-net-based techniques. In: van der Aalst, W.M.P., Desel, J., Oberweis, A. (eds.) BPM 2000. LNCS, vol. 1806, pp. 161–183. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  9. Hopcroft, J., Tarjan, R.: Dividing a graph into triconnected components. SIAM Journal on Computing 2(3), 135–158 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  10. Gutwenger, C., Mutzel, P.: A linear time implementation of SPQR-trees. In: Marks, J. (ed.) GD 2000. LNCS, vol. 1984, pp. 77–90. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  11. Polyvyanyy, A., Vanhatalo, J., Voelzer, H.: Simplified computation and generalization of the refined process structure tree. In: WS-FM, Hoboken, NJ, US, (to appear, September 2010)

    Google Scholar 

  12. Weidlich, M., Polyvyanyy, A., Mendling, J., Weske, M.: Efficient computation of causal behavioural profiles using structural decomposition. In: Lilius, J., Penczek, W. (eds.) Applications and Theory of Petri Nets. LNCS, vol. 6128, pp. 63–83. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  13. Fahland, D., Favre, C., Jobstmann, B., Koehler, J., Lohmann, N., Völzer, H., Wolf, K.: Instantaneous soundness checking of industrial business process models. In: Dayal, U., Eder, J., Koehler, J., Reijers, H.A. (eds.) BPM 2009. LNCS, vol. 5701, pp. 278–293. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  14. Vanhatalo, J., Völzer, H., Leymann, F.: Faster and more focused control-flow analysis for business process models through SESE decomposition. In: Krämer, B.J., Lin, K.-J., Narasimhan, P. (eds.) ICSOC 2007. LNCS, vol. 4749, pp. 43–55. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  15. Berthelot, G.: Transformations and decompositions of nets. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) APN 1986. LNCS, vol. 254, pp. 359–376. Springer, Heidelberg (1987)

    Google Scholar 

  16. Desel, J., Esparza, J.: Free Choice Petri Nets. Cambridge University Press, Cambridge (1995)

    Book  MATH  Google Scholar 

  17. Polyvyanyy, A.: Structural abstraction of process specifications. In: ZEUS (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Business Process Technology Group, Hasso Plattner Institute at the University of Potsdam, Prof.-Dr.-Helmert-Str. 2–3, D-14482, Potsdam, Germany

    Artem Polyvyanyy, Matthias Weidlich & Mathias Weske

Authors
  1. Artem Polyvyanyy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Matthias Weidlich
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mathias Weske
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. STAR Lab, Vrije Universiteit Brussel (VUB), Bldg G/10, Pleinlaan 2, 1050, Brussels, Belgium

    Robert Meersman

  2. Curtin University of Technology, DEBII - CBS, De Laeter Way, Bentley, 6102, WA, Australia

    Tharam Dillon

  3. Facultad de Informática, Universidad Politécnica de Madrid, Campus de Montegancedo S/N, 28660, Boadilla del Monte, Madrid, Spain

    Pilar Herrero

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Polyvyanyy, A., Weidlich, M., Weske, M. (2010). The Biconnected Verification of Workflow Nets. In: Meersman, R., Dillon, T., Herrero, P. (eds) On the Move to Meaningful Internet Systems: OTM 2010. OTM 2010. Lecture Notes in Computer Science, vol 6426. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16934-2_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16934-2_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16933-5

  • Online ISBN: 978-3-642-16934-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation