PSPACE-Completeness of the Soundness Problem of Safe Asymmetric-Choice Workflow Nets

DOI10.1007/978-3-030-51831-8_10zbMath1503.68195OpenAlexW3037792315MaRDI QIDQ5100757

GuanJun Liu

Publication date: 1 September 2022

Published in: Application and Theory of Petri Nets and Concurrency (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-51831-8_10

zbMATH Keywords

livenessPetri netssoundnessPSPACE-completenessworkflow netsasymmetric-choice nets

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Verification of data-aware process models: checking soundness of Data Petri nets ⋮ A memory-related vulnerability detection approach based on vulnerability model with Petri Net

Uses Software

• ePNK
• HybridILPMiner

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Soundness of workflow nets: classification, decidability, and analysis
• Complexity results for 1-safe nets
• Complexity of some problems in Petri nets
• Discovering workflow nets using integer linear programming
• Polynomial analysis algorithms for free choice probabilistic workflow nets
• On liveness and boundedness of asymmetric choice nets
• The ePNK: An Extensible Petri Net Tool for PNML
• A fresh look at free choice nets
• On liveness and controlled siphons in Petri nets
• Free Choice Petri Nets
• Understanding Petri Nets
• The reachability problem for Petri nets is not elementary
• Complexity of the Soundness Problem of Workflow Nets
• Applications and Theory of Petri Nets 2004

This page was built for publication: PSPACE-Completeness of the Soundness Problem of Safe Asymmetric-Choice Workflow Nets