Structural soundness of workflow nets is decidable

    Authors

    F. L. Tiplea;D. C. Marinescu

    Comments

    Authors: contact us about adding a copy of your work at STARS@ucf.edu

    Abbreviated Journal Title

    Inf. Process. Lett.

    Keywords

    Petri net; workflow net; soundness; decidability; algorithms; Computer Science, Information Systems

    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. (c) 2005 Elsevier B.V. All rights reserved.

    Journal Title

    Information Processing Letters

    Volume

    96

    Issue/Number

    2

    Publication Date

    1-1-2005

    Document Type

    Article

    Language

    English

    First Page

    54

    Last Page

    58

    WOS Identifier

    WOS:000232085200003

    ISSN

    0020-0190

    Share

    COinS