Verifying generalized soundness of workflow nets

Authors:
Kees van Hee;Olivia Oanea;Natalia Sidorova;Marc Voorhoeve
Affiliations:
Department of Mathematics and Computer Science, Eindhoven University of Technology, The Netherlands;Department of Mathematics and Computer Science, Eindhoven University of Technology, The Netherlands;Department of Mathematics and Computer Science, Eindhoven University of Technology, The Netherlands;Department of Mathematics and Computer Science, Eindhoven University of Technology, The Netherlands
Venue:
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Year:
2006

Citing 10
Cited 5

Theory of linear and integer programming

Theory of linear and integer programming
Behaviour preserving refinements of Petri nets

International Workshop WG '86 on Graph-theoretic concepts in computer science
The mathematics of Petri nets

The mathematics of Petri nets
Free choice Petri nets

Free choice Petri nets
Workflow management: models, methods, and systems

Workflow management: models, methods, and systems
Modular Construction and Partial Order Semantics of Petri Nets

Modular Construction and Partial Order Semantics of Petri Nets
Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library

SAS '02 Proceedings of the 9th International Symposium on Static Analysis
An algorithm for the general Petri net reachability problem

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Structural soundness of workflow nets is decidable

Information Processing Letters
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

The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems

Science of Computer Programming
Process-Aware Information Systems: Lessons to Be Learned from Process Mining

Transactions on Petri Nets and Other Models of Concurrency II
Applications of polyhedral computations to the analysis and verification of hardware and software systems

Theoretical Computer Science
Soundness verification for conceptual workflow nets with data: Early detection of errors with the most precision possible

Information Systems
Complexity of the soundness problem of bounded workflow nets

PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets

Quantified Score

Hi-index	0.00

Visualization

Abstract

We improve the decision procedure from [10] for the problem of generalized soundness of workflow nets. A workflow net is generalized sound iff every marking reachable from an initial marking with k tokens on the initial place terminates properly, i.e. it can reach a marking with k tokens on the final place, for an arbitrary natural number k. Our new decision procedure not only reports whether the net is sound or not, but also returns a counterexample in case the workflow net is not generalized sound. We report on experimental results obtained with the prototype we made and explain how the procedure can be used for the compositional verification of large workflows.