@inproceedings{ee5b334a928c49a99b0d37de941115d9,
title = "Verifying generalized soundness for workflow nets",
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.",
author = "\{Hee, van\}, K.M. and O.I. Oanea and N. Sidorova and M. Voorhoeve",
year = "2007",
doi = "10.1007/978-3-540-70881-0\_21",
language = "English",
isbn = "3-540-70880-4",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "235--247",
editor = "I. Virbitskaite and A. Voronkov",
booktitle = "Proceedings of the 6th International Andrei Ershov Memorial Conference : Perspectives of Systems Informatics (PSI 2006) 27-30 June 2006, Novosibirsk, Russia",
address = "Germany",
note = "conference; PSI 2006, Novosibirsk, Russia; 2006-06-27; 2006-06-30 ; Conference date: 27-06-2006 Through 30-06-2006",
}