QUT ePrints

Soundness of workflow nets with reset arcs

van der Aalst, Wil M. P., Hee, Kees M., ter Hofstede, Arthur H. M., Sidorova, Natalia, Verbeek, H. M. W., Voorhoeve, Marc, & Wynn, Moe T. (2009) Soundness of workflow nets with reset arcs. Lecture Notes in Computer Science: Transactions on Petri Nets and Other Models of Concurrency III, 5800, pp. 50-70.

[img] Accepted Version (PDF 439Kb)

    View at publisher

    Abstract

    Petri nets are often used to model and analyze workflows. Many workflow languages have been mapped onto Petri nets in order to provide formal semantics or to verify correctness properties. Typically, the so-called Workflow nets are used to model and analyze workflows and variants of the classical soundness property are used as a correctness notion. Since many workflow languages have cancelation features, a mapping to workflow nets is not always possible. Therefore, it is interesting to consider workflow nets with reset arcs. Unfortunately, soundness is undecidable for workflow nets with reset arcs. In this paper, we provide a proof and insights into the theoretical limits of workflow verification.

    Citations:

    2 times in Scopus
    Search Google Scholar™
    1 times in Web of Science

    Citation countsare sourced monthly from Scopus and Web of Science citation databases.

    These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science generally from 1980 onwards.

    Citations counts from the Google Scholar™ indexing service can be viewed at the linked Google Scholar™ search.

    Full-text downloads:

    47 since deposited on 17 Mar 2011
    38 in the past twelve months

    Full-text downloadsdisplays the total number of times this work’s files (e.g., a PDF) have been downloaded from QUT ePrints as well as the number of downloads in the previous 365 days. The count includes downloads for all files if a work has more than one.

    More statistics...
    ID Code: 40782
    Item Type: Journal Article
    Keywords: Petri Nets, Workflow Nets, Reset Nets, Soundness, Verification , Decidability
    DOI: 10.1007/978-3-642-04856-2_3
    ISSN: 0302-9743
    Subjects: Australian and New Zealand Standard Research Classification > INFORMATION AND COMPUTING SCIENCES (080000) > INFORMATION SYSTEMS (080600)
    Divisions: Past > QUT Faculties & Divisions > Faculty of Science and Technology
    Past > Schools > Information Systems
    Copyright Owner: Copyright 2009 Springer-Verlag Berlin Heidelberg
    Copyright Statement: This is the author-version of the work. Lecture Notes in Computer Science, published by Springer Verlag, are available via SpringerLink http://www.springer.de/comp/lncs/
    Deposited On: 17 Mar 2011 10:20
    Last Modified: 29 Feb 2012 23:59

    Export: EndNote | Dublin Core | BibTeX

    Staff only: HERDC collection form

    Repository Staff Only: item control page