Structural soundness of workflow nets is decidable

Authors:
Ferucio Laurenţiu Ţiplea;Dan Cristian Marinescu
Affiliations:
School of Computer Science, University of Central Florida, Orlando, FL 31826-2362, USA;School of Computer Science, University of Central Florida, Orlando, FL 31826-2362, USA
Venue:
Information Processing Letters
Year:
2005

Citing 3
Cited 2

Petri nets: an introduction

Petri nets: an introduction
Decidability and Complexity of Petri Net Problems - An Introduction

Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Soundness and separability of workflow nets in the stepwise refinement approach

ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets

Verifying generalized soundness of workflow nets

PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Information flow analysis of scientific workflows

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.89

Visualization

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.