Generalised Soundness of Workflow Nets Is Decidable

  title={Generalised Soundness of Workflow Nets Is Decidable},
  author={K. V. Hee and N. Sidorova and M. Voorhoeve},
  • 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
    84 Citations
    Verifying Generalized Soundness of Workflow Nets
    • 17
    • PDF
    Soundness for Resource-Constrained Workflow Nets Is Decidable
    • N. Sidorova, C. Stahl
    • Computer Science
    • IEEE Transactions on Systems, Man, and Cybernetics: Systems
    • 2013
    • 9
    • PDF
    Soundness of Workflow Nets with an Unbounded Resource is Decidable
    • 5
    • PDF
    Soundness of workflow nets with reset arcs is undecidable
    • 1
    • PDF
    Checking Properties of Adaptive Workflow Nets
    • 20
    • PDF
    Decidability Results for Soundness Criteria of Resource-Constrained Workflow Nets
    • 15
    Soundness of workflow nets: classification, decidability, and analysis
    • 337
    • PDF
    Complexity of the Soundness Problem of Bounded Workflow Nets
    • 11
    • PDF
    Complexity of the Soundness Problem of Workflow Nets
    • 14
    Soundness of Workflow Nets with Reset Arcs
    • 11
    • PDF


    Soundness and Separability of Workflow Nets in the Stepwise Refinement Approach
    • 132
    • PDF
    Verification of Workflow Nets
    • 900
    • Highly Influential
    • PDF
    Free choice Petri nets
    • 864
    • PDF
    Diagnosing Workflow Processes using Woflan
    • 399
    • PDF
    Theory of linear and integer programming
    • A. Schrijver
    • Mathematics, Computer Science
    • Wiley-Interscience series in discrete mathematics and optimization
    • 1999
    • 4,167
    • PDF
    Diagnosing work ow processes using wo an
    • The Computer Journal,
    • 2001
    Free Choice Petri nets., volume 40 of Cambridge Tracts in Theoretical Computer Science
    • 1995
    Analyse von Petri-Netz-Modellen
    • P. Starke
    • Computer Science
    • Leitfäden und Monographien der Informatik
    • 1990
    • 193
    • PDF
    Liveness in Petri Nets
    • Internal Report of the Gesellschaft f ur Mathematik und Datenverarbeitung,
    • 1975