The complexity of soundness in workflow nets

01/14/2022
by   Michael Blondin, et al.
0

Workflow nets are a popular variant of Petri nets that allow for algorithmic formal analysis of business processes. The central decision problems concerning workflow nets deal with soundness, where the initial and final configurations are specified. Intuitively, soundness states that from every reachable configuration one can reach the final configuration. We settle the widely open complexity of the three main variants of soundness: classical, structural and generalised soundness. The first two are EXPSPACE-complete, and, surprisingly, the latter is PSPACE-complete, thus computationally simpler.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/06/2022

Verifying generalised and structural soundness of workflow nets via relaxations

Workflow nets are a well-established mathematical formalism for the anal...
research
12/31/2021

Structural Liveness of Immediate Observation Petri Nets

We show that the structural liveness problem for immediate observation n...
research
11/16/2018

Computing the Expected Execution Time of Probabilistic Workflow Nets

Free-Choice Workflow Petri nets, also known as Workflow Graphs, are a po...
research
02/22/2018

Computing the concurrency threshold of sound free-choice workflow nets

Workflow graphs extend classical flow charts with concurrent fork and jo...
research
03/23/2023

Stochastic Decision Petri Nets

We introduce stochastic decision Petri nets (SDPNs), which are a form of...
research
03/19/2022

Language-Preserving Reduction Rules for Block-Structured Workflow Nets

Process models are used by human analysts to model and analyse behaviour...
research
05/11/2020

Elements of Petri nets and processes

We present a formalism for Petri nets based on polynomial-style finite-s...

Please sign up or login with your details

Forgot password? Click here to reset