Generalised soundness of workflow nets is decidable

M. Voorhoeve, K.M. Hee, van, N. Sidorova

Onderzoeksoutput: Boek/rapportRapportAcademic

262 Downloads (Pure)


Abstract. We investigate the decidability of the problem of generalised soundness for Workflow nets: "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". We start with considering simple correctness criteria for Workflow nets and reduce them to the check of structural properties formulated in terms of traps and siphons, which can be easily checked. We call the nets that possess those properties Batch Workflow nets (BWF-nets). We show that every WF-net is either not sound or it can be transformed to a BWF-net with the same behaviour. Then we use algebraic methods to prove that generalized soundness is decidable for BWF-nets and give a decision procedure. Keywords: Petri nets; workflows; verification; soundness, decidability.
Originele taal-2Engels
Plaats van productieEindhoven
UitgeverijTechnische Universiteit Eindhoven
Aantal pagina's18
StatusGepubliceerd - 2003

Publicatie series

NaamComputer science reports
ISSN van geprinte versie0926-4515


Duik in de onderzoeksthema's van 'Generalised soundness of workflow nets is decidable'. Samen vormen ze een unieke vingerafdruk.

Citeer dit