Soundness for resource-constrained workflow nets is decidable

N. Sidorova; C. Stahl

doi:10.1109/TSMCA.2012.2210415

Soundness for resource-constrained workflow nets is decidable

N. Sidorova, C. Stahl

Process Science

Research output: Contribution to journal › Article › Academic › peer-review

11 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 language	English
Pages (from-to)	724-729
Journal	IEEE Transactions on Systems, Man, and Cybernetics: Systems
Volume	43
Issue number	3
DOIs	https://doi.org/10.1109/TSMCA.2012.2210415
Publication status	Published - 2013

Access to Document

10.1109/TSMCA.2012.2210415

Cite this

@article{78d72edd1470401686ef569634d9434e,

title = "Soundness for resource-constrained workflow nets is decidable",

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.",

author = "N. Sidorova and C. Stahl",

year = "2013",

doi = "10.1109/TSMCA.2012.2210415",

language = "English",

volume = "43",

pages = "724--729",

journal = "IEEE Transactions on Systems, Man, and Cybernetics: Systems",

issn = "2168-2216",

publisher = "Institute of Electrical and Electronics Engineers",

number = "3",

}

TY - JOUR

T1 - Soundness for resource-constrained workflow nets is decidable

AU - Sidorova, N.

AU - Stahl, C.

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

U2 - 10.1109/TSMCA.2012.2210415

DO - 10.1109/TSMCA.2012.2210415

M3 - Article

SN - 2168-2216

VL - 43

SP - 724

EP - 729

JO - IEEE Transactions on Systems, Man, and Cybernetics: Systems

JF - IEEE Transactions on Systems, Man, and Cybernetics: Systems

IS - 3

ER -

Soundness for resource-constrained workflow nets is decidable

Abstract

Access to Document

Fingerprint

Cite this