Soundness for resource-constrained workflow nets is decidable

N. Sidorova, C. Stahl

Research output: Contribution to journalArticleAcademicpeer-review

7 Citations (Scopus)

Abstract

We investigate the veri¿cation of the soundness property for work¿ow nets (WF-nets) extended with resources, thereby considering the most general instance of soundness, which requires that, for any number of instances, the WF-net has always the possibility to terminate, for a certain initial (¿nite) number of resource items per resource type; moreover, adding additional resources to a sound net does not violate the result. We prove that this problem is decidable by reducing it to a home-space problem, and we show how soundness can be decided by using the procedure for deciding a home-space property.
Original languageEnglish
Pages (from-to)724-729
JournalIEEE Transactions on Systems, Man, and Cybernetics: Systems
Volume43
Issue number3
DOIs
Publication statusPublished - 2013

Fingerprint

Dive into the research topics of 'Soundness for resource-constrained workflow nets is decidable'. Together they form a unique fingerprint.

Cite this