Anzeige
Erschienen in:
2007 | OriginalPaper | Buchkapitel
Verifying Generalized Soundness of Workflow Nets
verfasst von : Kees van Hee, Olivia Oanea, Natalia Sidorova, Marc Voorhoeve
Erschienen in: Perspectives of Systems Informatics
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.