Title

Structural Soundness Of Workflow Nets Is Decidable

Keywords

Algorithms; Decidability; Petri net; Soundness; Workflow net

Abstract

The problem of deciding whether a given workflow net is k-sound for some k ≥ 1 is known as structural soundness. We prove that structural soundness of workflow nets is decidable. © 2005 Elsevier B.V. All rights reserved.

Publication Date

10-31-2005

Publication Title

Information Processing Letters

Volume

96

Issue

2

Number of Pages

54-58

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1016/j.ipl.2005.06.002

Socpus ID

27544439061 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/27544439061

This document is currently not available here.

Share

COinS