Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

Accepted for publication in Formal Aspects of Computing Soundness of Workflow Nets

Summary: Accepted for publication in Formal Aspects of Computing
Soundness of Workflow Nets:
Classification, Decidability, and
W.M.P. van der Aalst1,2
, K.M. van Hee1
, A.H.M. ter Hofstede2,1
, N. Sidorova1
H.M.W. Verbeek1
, M. Voorhoeve1
, and M.T. Wynn2
1Eindhoven University of Technology, Eindhoven, The Netherlands,
2Queensland University of Technology, Brisbane, Australia
Abstract. Workflow nets, a particular class of Petri nets, have become one of the standard ways to model
and analyze workflows. Typically, they are used as an abstraction of the workflow that is used to check
the so-called soundness property. This property guarantees the absence of livelocks, deadlocks, and other
anomalies that can be detected without domain knowledge. Several authors have proposed alternative no-
tions of soundness and have suggested to use more expressive languages, e.g., models with cancellations or
priorities. This paper provides an overview of the different notions of soundness and investigates these in the


Source: Aalst, W.M.P.van der - Wiskunde en Informatica, Technische Universiteit Eindhoven


Collections: Computer Technologies and Information Sciences