• DOI:10.1007/978-3-540-27793-4_12
Corpus ID: 5968105

Generalised Soundness of Workflow Nets Is Decidable

@inproceedings{Hee2004GeneralisedSO,
  title={Generalised Soundness of Workflow Nets Is Decidable},
  author={K. V. Hee and N. Sidorova and M. Voorhoeve},
  booktitle={ICATPN},
  year={2004}
}

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

Published in ICATPN 2004

Computer Science, Psychology

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… CONTINUE READING

View via Publisher

pure.tue.nl

Save to Library

Create Alert

Cite

Launch Research Feed