Structural soundness of workflow nets is decidable

doi:10.1016/j.ipl.2005.06.002

Information Processing Letters

Volume 96, Issue 2, 31 October 2005, Pages 54-58

https://doi.org/10.1016/j.ipl.2005.06.002 Get rights and content

Abstract

The problem of deciding whether a given workflow net is k-sound for some $k ⩾ 1$ is known as structural soundness. We prove that structural soundness of workflow nets is decidable.

References (9)

V.M.P. van der Aalst, Structural characterization of sound workflow nets, Computing Science Report 96/23, Eindhoven...
V.M.P. van der Aalst
The application of Petri nets to workflow management
J. Circuits, Systems, Comput.
(1998)
K. Barkaoui, I.B. Abdallah, Analysis of a resource allocation problem in FMS using structure theory of Petri nets, in:...
K. Barkaoui, Control systems design for automated manufacturing systems, Technical Report, CEDRIC,...

There are more references available in the full text version of this article.

Cited by (28)

Information flow analysis of scientific workflows
2010, Journal of Computer and System Sciences
Recently, scientific workflows have emerged as a platform for automating and accelerating data processing and data sharing in scientific communities. Many scientific workflows have been developed for collaborative research projects that involve a number of geographically distributed organizations. Sharing of data and computation across organizations in different administrative domains is essential in such a collaborative environment. Because of the competitive nature of scientific research, it is important to ensure that sensitive information in scientific workflows can be accessed by and propagated to only authorized parties. To address this problem, we present techniques for analyzing how information propagates in scientific workflows. We also present algorithms for incrementally analyzing how information propagates upon every change to an existing scientific workflow.
Acyclic Petri and Workflow Nets with Resets
2023, Leibniz International Proceedings in Informatics, LIPIcs
Acyclic Petri and Workflow Nets with Resets
2023, arXiv
The complexity of soundness in workflow nets
2022, Proceedings - Symposium on Logic in Computer Science
Verifying generalised and structural soundness of workflow nets via relaxations
2022, arXiv
The complexity of soundness in workflow nets
2022, arXiv

View all citing articles on Scopus

^☆: The research reported in this paper was partially supported by National Science Foundation, Grants MCB9527131, DBI0296107, ACI0296035, and EIA0296179, and by National University Research Council of Romania, Grants CNCSIS 28/632/2004 and CNCSIS 50/632/2005.

¹: Ferucio Laurenţiu Ţiplea is with Department of Computer Science, “Al.I. Cuza” University, Iasi, Romania. The research reported here was carried out while Ferucio Laurenţiu Ţiplea was visiting the School of Computer Science, University of Central Florida, Orlando 32816-2362, FL, USA.

View full text

Structural soundness of workflow nets is decidable☆

Abstract

The application of Petri nets to workflow management

J. Circuits, Systems, Comput.