Complexity of the Soundness Problem of Bounded Workflow Nets

DOI10.1007/978-3-642-31131-4_6zbMath1357.68075OpenAlexW1773689831MaRDI QIDQ2908201

GuanJun Liu, Yang Liu, Jin-Song Dong, Jun Sun

Publication date: 4 September 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://ink.library.smu.edu.sg/sis_research/5013

zbMATH Keywords

Petri netssoundnessworkflow netsPSPACE-hardnessco-NP-hardnessworkflow nets with reset arcs

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) Theory of organizations, manpower planning in operations research (90B70)

Related Items (1)

Complexity of the deadlock problem for Petri nets modeling resource allocation systems

This page was built for publication: Complexity of the Soundness Problem of Bounded Workflow Nets