By Topic

Soundness for S - and A -Timed Workflow Nets Is Undecidable

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ferucio Laurentiu Tiplea ; Dept. of Comput. Sci., Alexandru loan Cuza Univ. of Iasi, Iasi ; Geanina Ionela Macovei

The main purpose of workflow management systems is to support the definition, execution, and control of workflow processes. With or without time constraints, workflow management systems should satisfy certain correctness properties. The most important and widely used is the soundness property . In this paper, we focus on the soundness property for two classes of Petri-net-based workflow management systems with time constraints, S- and A-timed workflow nets (WNs), and we show that this property is undecidable for them. The proof technique, based on the undecidability of the halting problem for deterministic counter machines, shows first that the reachability, coverability, boundedness, and quasi-liveness problems are undecidable for these two classes of timed WNs, and then, as a consequence, the undecidability of the soundness problem is derived.

Published in:

IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans  (Volume:39 ,  Issue: 4 )