Soundness of Resource-Constrained Workflow Nets

  • Kees van Hee
  • Alexander Serebrenik
  • Natalia Sidorova
  • Marc Voorhoeve
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3536)

Abstract

We study concurrent processes modelled as workflow Petri nets extended with resource constraints. We define a behavioural correctness criterion called soundness: given a sufficient initial number of resources, all cases in the net are guaranteed to terminate successfully, no matter which schedule is used. We give a necessary and sufficient condition for soundness and an algorithm that checks it.

Keywords

Petri nets concurrency workflow resources verification 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Kees van Hee
    • 1
  • Alexander Serebrenik
    • 1
  • Natalia Sidorova
    • 1
  • Marc Voorhoeve
    • 1
  1. 1.Department of Mathematics and Computer ScienceEindhoven University of TechnologyEindhovenThe Netherlands

Personalised recommendations