{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T19:12:04Z","timestamp":1767985924718,"version":"3.49.0"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,6,29]],"date-time":"2011-06-29T00:00:00Z","timestamp":1309305600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1007\/s00236-011-0137-8","type":"journal-article","created":{"date-parts":[[2011,6,28]],"date-time":"2011-06-28T09:57:40Z","timestamp":1309255060000},"page":"213-242","source":"Crossref","is-referenced-by-count":4,"title":["Connectivity of workflow nets: the foundations of stepwise verification"],"prefix":"10.1007","volume":"48","author":[{"given":"Artem","family":"Polyvyanyy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Weidlich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathias","family":"Weske","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,6,29]]},"reference":[{"key":"137_CR1","doi-asserted-by":"crossref","unstructured":"Berthelot, G.: Checking properties of nets using transformation. In: ATPN. Volume 222 of Lecture Notes in Computer Science. Springer, Berlin, pp. 19\u201340 (1986)","DOI":"10.1007\/BFb0016204"},{"key":"137_CR2","doi-asserted-by":"crossref","unstructured":"Berthelot, G.: Transformations and decompositions of nets. In: Advances in Petri Nets. Volume 254 of Lecture Notes in Computer Science. Springer, Berlin, pp. 359\u2013376 (1987)","DOI":"10.1007\/978-3-540-47919-2_13"},{"key":"137_CR3","doi-asserted-by":"crossref","unstructured":"Battista, G.D., Tamassia, R.: On-line graph algorithms with SPQR-trees. In: ICALP. Volume 443 of Lecture Notes in Computer Science. Springer, Berlin, pp. 598\u2013611 (1990)","DOI":"10.1007\/BFb0032061"},{"key":"137_CR4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511526558","volume-title":"Free Choice Petri Nets","author":"J. Desel","year":"1995","unstructured":"Desel J., Esparza J.: Free Choice Petri Nets. Cambridge University Press, Cambridge (1995)"},{"key":"137_CR5","volume-title":"Graph Theory","author":"R. Diestel","year":"2005","unstructured":"Diestel R.: Graph Theory. Springer, Berlin (2005)"},{"issue":"7","key":"137_CR6","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1109\/TSE.2004.33","volume":"30","author":"R. Eshuis","year":"2004","unstructured":"Eshuis R., Wieringa R.: Tool support for verifying UML activity diagrams. IEEE Trans. Softw. Eng. (TSE) 30(7), 437\u2013447 (2004)","journal-title":"IEEE Trans. Softw. Eng. (TSE)"},{"key":"137_CR7","doi-asserted-by":"crossref","unstructured":"Esparza, J., Silva, M.: Circuits, handles, bridges and nets. In: ATPN. Volume 483 of Lecture Notes in Computer Science. Springer, Berlin, pp. 210\u2013242 (1991)","DOI":"10.1007\/3-540-53863-1_27"},{"key":"137_CR8","doi-asserted-by":"crossref","unstructured":"Fahland, D., Favre, C., Jobstmann, B., Koehler, J., Lohmann, N., V\u00f6lzer H., Wolf K.: Instantaneous soundness checking of industrial business process models. In: BPM. Volume 5701 of Lecture Notes in Computer Science. Springer, Berlin, pp. 278\u2013293 (2009)","DOI":"10.1007\/978-3-642-03848-8_19"},{"key":"137_CR9","doi-asserted-by":"crossref","unstructured":"Gutwenger, C., Mutzel, P.: A linear time implementation of SPQR-trees. In: Graph Drawing. Volume 1984 of Lecture Notes in Computer Science. Springer, Berlin, pp. 77\u201390 (2001)","DOI":"10.1007\/3-540-44541-2_8"},{"issue":"3","key":"137_CR10","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"J. Hopcroft","year":"1973","unstructured":"Hopcroft J., Tarjan R.E.: Dividing a graph into triconnected components. SIAM J. Comput. (SIAMCOMP) 2(3), 135\u2013158 (1973)","journal-title":"SIAM J. Comput. (SIAMCOMP)"},{"issue":"6","key":"137_CR11","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1145\/362248.362272","volume":"16","author":"J. Hopcroft","year":"1973","unstructured":"Hopcroft J., Tarjan R.E.: Algorithm 447: efficient algorithms for graph manipulation. Commun. ACM (CACM) 16(6), 372\u2013378 (1973)","journal-title":"Commun. ACM (CACM)"},{"key":"137_CR12","unstructured":"Johnson, R.C.: Efficient Program Analysis Using Dependence Flow Graphs. PhD thesis, Cornell University, Ithaca, NY, USA (1995)"},{"key":"137_CR13","doi-asserted-by":"crossref","unstructured":"Kemper, P.: Linear time algorithm to find a minimal deadlock in a strongly connected free-choice net. In: ATPN. Volume 691 of Lecture Notes in Computer Science. Springer, Berlin, pp. 319\u2013338 (1993)","DOI":"10.1007\/3-540-56863-8_54"},{"key":"137_CR14","unstructured":"Keller, G., N\u00fcttgens, M., Scheer, A.W.: Semantische Proze\u00dfmodellierung auf der Grundlage \u2018Ereignisgesteuerter Proze\u00dfketten (EPK)\u2019. Ver\u00f6ffentlichungen des Instituts f\u00fcr schaftsinformatik (IWi), Universit\u00e4t des Saarlandes (January 1992) In German"},{"issue":"3","key":"137_CR15","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s00236-002-0105-4","volume":"39","author":"B. Kiepuszewski","year":"2003","unstructured":"Kiepuszewski B., ter Hofstede A.H.M., van der Aalst W.M.P.: Fundamentals of control flow in workflows. Acta Informatica 39(3), 143\u2013209 (2003)","journal-title":"Acta Informatica"},{"key":"137_CR16","doi-asserted-by":"crossref","unstructured":"Kindler, E.: On the semantics of EPCs: A framework for resolving the vicious circle. In: BPM. Volume 3080 of Lecture Notes in Computer Science. Springer, Berlin, pp. 82\u201397 (2004)","DOI":"10.1007\/978-3-540-25970-1_6"},{"key":"137_CR17","doi-asserted-by":"crossref","unstructured":"Lohmann, N.: A feature-complete Petri net semantics for WS-BPEL 2.0. In: WS-FM. Volume 4937 of Lecture Notes in Computer Science. Springer, Berlin, pp. 77\u201391 (2008)","DOI":"10.1007\/978-3-540-79230-7_6"},{"key":"137_CR18","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1007\/978-3-642-00899-3_3","volume":"2","author":"N. Lohmann","year":"2009","unstructured":"Lohmann N., Verbeek E., Dijkman R.M.: Petri net transformations for business processes\u2014a survey. Trans. Petri Nets Other Models Concurr. (TOPNOC) 2, 46\u201363 (2009)","journal-title":"Trans. Petri Nets Other Models Concurr. (TOPNOC)"},{"key":"137_CR19","doi-asserted-by":"crossref","first-page":"96","DOI":"10.4064\/fm-10-1-96-115","volume":"10","author":"K. Menger","year":"1927","unstructured":"Menger K.: Zur allgemeinen Kurventheorie. Fund. Math. 10, 96\u2013115 (1927)","journal-title":"Fund. Math."},{"issue":"4","key":"137_CR20","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1109\/5.24143","volume":"77","author":"T. Murata","year":"1989","unstructured":"Murata T.: Petri nets: properties, analysis and applications. Proc. IEEE (PIEEE) 77(4), 541\u2013580 (1989)","journal-title":"Proc. IEEE (PIEEE)"},{"key":"137_CR21","unstructured":"Object Management Group: Unified Modeling Language: Superstructure (UML) version 2.1.1(February 2007)"},{"key":"137_CR22","unstructured":"Object Management Group: Business Process Model and Notation (BPMN) version 2.0 beta 2 (June 2010)"},{"key":"137_CR23","doi-asserted-by":"crossref","unstructured":"Polyvyanyy, A., Smirnov, S., Weske, M.: The triconnected abstraction of process models. In: BPM. Volume 5701 of Lecture Notes in Computer Science. Springer, Berlin, pp. 229\u2013244 (2009)","DOI":"10.1007\/978-3-642-03848-8_16"},{"key":"137_CR24","unstructured":"Polyvyanyy, A.: Structural abstraction of process specifications. In: ZEUS. Volume 563 of CEUR Workshop Proceedings. CEUR-WS.org, pp. 73\u201379 (2010)"},{"key":"137_CR25","doi-asserted-by":"crossref","unstructured":"Polyvyanyy, A., Weidlich, M., Weske, M.: The biconnected verification of workflow nets. In: OTM Conferences (1). Volume 6426 of Lecture Notes in Computer Science. Springer, Berlin, pp. 410\u2013418 (2010)","DOI":"10.1007\/978-3-642-16934-2_29"},{"key":"137_CR26","doi-asserted-by":"crossref","unstructured":"Polyvyanyy, A., Vanhatalo, J., V\u00f6lzer, H.: Simplified computation and generalization of the refined process structure tree. In: WS-FM. Volume 6551 of Lecture Notes in Computer Science. Springer, Berlin, pp. 25\u201341 (2011)","DOI":"10.1007\/978-3-642-19589-1_2"},{"key":"137_CR27","unstructured":"Reisig, W.: Petri Nets: An Introduction. Volume 4 of Monographs in Theoretical Computer Science. An EATCS Series. Springer, Berlin (1985)"},{"key":"137_CR28","volume-title":"Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica","author":"S.S. Skiena","year":"1990","unstructured":"Skiena S.S.: Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Addison-Wesley, Reading (1990)"},{"issue":"2","key":"137_CR29","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R.E. Tarjan","year":"1972","unstructured":"Tarjan R.E.: Depth-first search and linear graph algorithms. SIAM J. Comput. (SIAMCOMP) 1(2), 146\u2013160 (1972)","journal-title":"SIAM J. Comput. (SIAMCOMP)"},{"issue":"1","key":"137_CR30","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0022-0000(79)90050-3","volume":"18","author":"R. Valette","year":"1979","unstructured":"Valette R.: Analysis of petri nets by stepwise refinements. J. Comput. Syst. Sci. (JCSS) 18(1), 35\u201346 (1979)","journal-title":"J. Comput. Syst. Sci. (JCSS)"},{"key":"137_CR31","doi-asserted-by":"crossref","unstructured":"Tarjan, R.E., Valdes, J.: Prime subprogram parsing of a program. In: POPL, pp. 95\u2013105 (1980)","DOI":"10.1145\/567446.567456"},{"key":"137_CR32","doi-asserted-by":"crossref","unstructured":"van der Aalst, W.M.P.: Verification of workflow nets. In: ICATPN. Volume 1248 of Lecture Notes in Computer Science. Springer, Berlin, pp. 407\u2013426 (1997)","DOI":"10.1007\/3-540-63139-9_48"},{"issue":"1","key":"137_CR33","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1142\/S0218126698000043","volume":"8","author":"W.M.P. Aalst van der","year":"1998","unstructured":"van der Aalst W.M.P.: The application of Petri nets to workflow management. J. Circuits Syst. Comput. (JCSC) 8(1), 21\u201366 (1998)","journal-title":"J. Circuits Syst. Comput. (JCSC)"},{"key":"137_CR34","doi-asserted-by":"crossref","unstructured":"van der Aalst, W.M.P.: Workflow verification: finding control-flow errors using Petri-net-based techniques. In: BPM. Volume 1806 of Lecture Notes in Computer Science. Springer, Berlin, pp 161\u2013183 (2000)","DOI":"10.1007\/3-540-45594-9_11"},{"key":"137_CR35","doi-asserted-by":"crossref","unstructured":"Vanhatalo, J., V\u00f6lzer, H., Leymann, F.: Faster and more focused control-flow analysis for business process models through SESE decomposition. In: ICSOC. Volume 4749 of Lecture Notes in Computer Science. Springer, Berlin, pp. 43\u201355 (2007)","DOI":"10.1007\/978-3-540-74974-5_4"},{"key":"137_CR36","doi-asserted-by":"crossref","unstructured":"Vanhatalo, J., V\u00f6lzer, H., Koehler, J.: The refined process structure tree. In: BPM. Volume 5240 of Lecture Notes in Computer Science. Springer, Berlin, pp. 100\u2013115 (2008)","DOI":"10.1007\/978-3-540-85758-7_10"},{"issue":"9","key":"137_CR37","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1016\/j.datak.2009.02.015","volume":"68","author":"J. Vanhatalo","year":"2009","unstructured":"Vanhatalo J., V\u00f6lzer H., Koehler J.: The refined process structure tree. Data Knowl. Eng. (DKE) 68(9), 793\u2013818 (2009)","journal-title":"Data Knowl. Eng. (DKE)"},{"issue":"4","key":"137_CR38","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1093\/comjnl\/44.4.246","volume":"44","author":"E. Verbeek","year":"2001","unstructured":"Verbeek E., Basten T., van der Aalst W.M.P.: Diagnosing workflow processes using woflan. Comput. J. (CJ) 44(4), 246\u2013279 (2001)","journal-title":"Comput. J. (CJ)"},{"issue":"2","key":"137_CR39","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/j.jcss.2009.06.003","volume":"76","author":"E. Verbeek","year":"2010","unstructured":"Verbeek E., Wynn M.T., van der Aalst W.M.P., ter Hofstede A.H.M.: Reduction rules for reset\/inhibitor nets. J. Comput. Syst. Sci. (JCSS) 76(2), 125\u2013143 (2010)","journal-title":"J. Comput. Syst. Sci. (JCSS)"},{"issue":"1\u20132","key":"137_CR40","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0304-3975(00)00321-2","volume":"270","author":"W.M.P. Aalst van der","year":"2002","unstructured":"van der Aalst W.M.P., Basten T.: Inheritance of workflows: an approach to tackling problems related to change. Theor. Comput. Sci. (TCS) 270(1\u20132), 125\u2013203 (2002)","journal-title":"Theor. Comput. Sci. (TCS)"},{"key":"137_CR41","doi-asserted-by":"crossref","unstructured":"Weidlich, M., Polyvyanyy, A., Mendling J., Weske M.: Efficient computation of causal behavioural profiles using structural decomposition. In: Petri Nets. Volume 6128 of Lecture Notes in Computer Science. Springer, Berlin, pp. 63\u201383 (2010)","DOI":"10.1007\/978-3-642-13675-7_6"},{"key":"137_CR42","volume-title":"Business Process Management: Concepts Languages Architectures","author":"M. Weske","year":"2007","unstructured":"Weske M.: Business Process Management: Concepts Languages Architectures. Springer, Berlin (2007)"},{"key":"137_CR43","doi-asserted-by":"crossref","unstructured":"Wolf, K.: Generating Petri net state spaces. In: ICATPN. Volume 4546 of Lecture Notes in Computer Science. Springer, Berlin, pp. 29\u201342 (2007)","DOI":"10.1007\/978-3-540-73094-1_5"},{"issue":"6","key":"137_CR44","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1016\/j.ins.2008.10.033","volume":"179","author":"M.T. Wynn","year":"2009","unstructured":"Wynn M.T., Verbeek E., van der Aalst W.M.P., ter Hofstede A.H.M., Edmond D.: Soundness-preserving reduction rules for reset workflow nets. Inf. Sci. (ISCI) 179(6), 769\u2013790 (2009)","journal-title":"Inf. Sci. (ISCI)"},{"issue":"6","key":"137_CR45","doi-asserted-by":"crossref","first-page":"1010","DOI":"10.1016\/j.infsof.2008.12.002","volume":"51","author":"M.T. Wynn","year":"2009","unstructured":"Wynn M.T., Verbeek E., van der Aalst W.M.P., ter Hofstede A.H.M., Edmond D.: Reduction rules for YAWL workflows with cancellation regions and OR-joins. Inf. Softw. Technol. (INFSOF) 51(6), 1010\u20131020 (2009)","journal-title":"Inf. Softw. Technol. (INFSOF)"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-011-0137-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-011-0137-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-011-0137-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T12:54:15Z","timestamp":1560344055000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-011-0137-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,29]]},"references-count":45,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["137"],"URL":"https:\/\/doi.org\/10.1007\/s00236-011-0137-8","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,29]]}}}