Pushing the Limits: Concurrency Detection in Acyclic Sound Free-Choice Workflow Nets in $O(P^2 + T^2)$ (2401.16097v2)
Abstract: Concurrency is an important aspect of Petri nets to describe and simulate the behavior of complex systems. Knowing which places and transitions could be executed in parallel helps to understand nets and enables analysis techniques and the computation of other properties, such as causality, exclusivity, etc.. All techniques based on concurrency detection depend on the efficiency of this detection methodology. Kovalyov and Esparza have developed algorithms that compute all concurrent places in $O\big((P+T)TP2\big)$ for live and bounded nets (where $P$ and $T$ are the numbers of places and transitions) and in $O\big(P(P+T)2\big)$ for live and bounded free-choice nets. Although these algorithms have a reasonably good computational complexity, large numbers of concurrent pairs of nodes may still lead to long computation times. This paper complements the palette of concurrency detection algorithms with the Concurrent Paths (CP) algorithm for sound free-choice workflow nets. The algorithm allows parallelization and has a worst-case computational complexity of $O(P2 + T2)$ for acyclic nets and of $O(P3 + PT2)$ for cyclic nets. Although the computational complexity of cyclic nets has not improved, the evaluation shows the benefits of CP, especially, if the net contains many nodes in concurrency relation.
- Complexity results for 1-safe nets. Theor. Comput. Sci. 147, 1&2 (1995), 117–136.
- Introduction to Algorithms, 3rd Edition. MIT Press, 2009.
- Managing large collections of business process models - current techniques and challenges. Comput. Ind. 63, 2 (2012), 91–97.
- An improvement of McMillan’s unfolding algorithm. Formal Methods Syst. Des. 20, 3 (2002), 285–310.
- Analysis on demand: Instantaneous soundness checking of industrial business process models. Data Knowl. Eng. 70, 5 (2011), 448–466. https://web.archive.org/web/20131208132841/http://service-technology.org/publications/fahlandfjklvw_2009_bpm, last visited in Jan. 2024.
- The relationship between workflow graphs and free-choice workflow nets. Inf. Syst. 47 (2015), 197–219.
- Partitioning behavioral retrieval: An efficient computational approach with transitive rules. IEEE Access 9 (2021), 112043–112056.
- Kovalyov, A. Concurrency relations and the safety problem for Petri nets. In Application and Theory of Petri Nets 1992, 13th International Conference, Sheffield, UK, June 22-26, 1992, Proceedings (1992), K. Jensen, Ed., vol. 616 of Lecture Notes in Computer Science, Springer, pp. 299–309.
- A Polynomial Algorithm to Compute the Concurrency Relation of Free-Choice Signal Transition Graphs. Sonderforschungsbereich 342: Methoden und Werkzeuge für die Nutzung paralleler Rechnerarchitekturen TUM-19528, SFB-Bericht Nr. 342/15/95 A, Institut für Informatik, Technische Universität München, München, Germany, Oct. 1995.
- The 4C Spectrum of fundamental behavioral relations for concurrent systems. In Application and Theory of Petri Nets and Concurrency - 35th International Conference, PETRI NETS 2014, Tunis, Tunisia, June 23-27, 2014. Proceedings (2014), G. Ciardo and E. Kindler, Eds., vol. 8489 of Lecture Notes in Computer Science, Springer, pp. 210–232.
- Understanding and decomposing control-flow loops in business process models. In Business Process Management - 20th International Conference, BPM 2022, Münster, Germany, September 11-16, 2022, Proceedings (2022), C. D. Ciccio, R. M. Dijkman, A. del-Río-Ortega, and S. Rinderle-Ma, Eds., vol. 13420 of Lecture Notes in Computer Science, Springer, pp. 307–323.
- Soundness unknotted: Efficient algorithm for process models with inclusive gateways by loosening loops. SSRN (2023). Preprint.
- Beyond soundness: on the verification of semantic business process models. Distributed Parallel Databases 27, 3 (2010), 271–343.
- Efficient consistency measurement based on behavioral profiles of process models. IEEE Trans. Software Eng. 37, 3 (2011), 410–429.
- Efficient computation of causal behavioural profiles using structural decomposition. In Applications and Theory of Petri Nets, 31st International Conference, PETRI NETS 2010, Braga, Portugal, June 21-25, 2010. Proceedings (2010), J. Lilius and W. Penczek, Eds., vol. 6128 of Lecture Notes in Computer Science, Springer, pp. 63–83.