BIROn - Birkbeck Institutional Research Online

    On determining the AND-OR hierarchy in workflow nets

    Sroka, J. and Hidders, Jan (2017) On determining the AND-OR hierarchy in workflow nets. Fundamenta Informaticae 156 (1), pp. 95-123. ISSN 0169-2968.

    Sroka and Hidders - 2017 - On Determining the AND-OR Hierarchy in Workflow Ne.pdf - Author's Accepted Manuscript

    Download (385kB) | Preview


    This paper presents a notion of reduction where a WF net is transformed into a smaller net by iteratively contracting certain well-formed subnets into single nodes until no more of such contractions are possible. This reduction can reveal the hierarchical structure of a WF net, and since it preserves certain semantic properties such as soundness, can help with analysing and understanding why a WF net is sound or not. The reduction can also be used to verify if a WF net is an AND-OR net. This class of WF nets was introduced in earlier work, and arguably describes nets that follow good hierarchical design principles. It is shown that the reduction is confluent up to isomorphism, which means that despite the inherent non-determinism that comes from the choice of subnets that are contracted, the final result of the reduction is always the same up to the choice of the identity of the nodes. Based on this result, a polynomial-time algorithm is presented that computes this unique result of the reduction. Finally, it is shown how this algorithm can be used to verify if a WF net is an AND-OR net.


    Item Type: Article
    School: Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
    Research Centres and Institutes: Birkbeck Knowledge Lab
    Depositing User: Jan Hidders
    Date Deposited: 14 Feb 2020 15:56
    Last Modified: 09 Aug 2023 12:47


    Activity Overview
    6 month trend
    6 month trend

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item