Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations

DOI10.1007/978-3-031-13188-2_23MaRDI QIDQ6487345zbMATH OpenFDO

Authors Michael Blondin, Filip Mazowiecki, Philip Offtermatt

Publication date 7 December 2022

Copyright license Creative Commons Attribution 4.0 International

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Theory of organizations, manpower planning in operations research (90B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Verifying generalized soundness of workflow nets
• Applications and Theory of Petri Nets 2004
• Reduction of workflow nets for generalised soundness verification
• Soundness of workflow nets: classification, decidability, and analysis
• Model checking workflow net based on Petri net

Cites work

• scientific article; zbMATH DE number 1696472 (Why is no real title available?)
• scientific article; zbMATH DE number 3582425 (Why is no real title available?)
• An SMT-based approach to coverability analysis
• Applications and Theory of Petri Nets 2004
• Complexity analysis of continuous Petri nets
• Context-free commutative grammars with integer counters and resets
• Diagnosing workflow processes using Woflan
• Diagnostic information for control-flow analysis of workflow graphs (a.k.a. free-choice workflow nets)
• Free Choice Petri Nets
• Fundamentals of control flow in workflows
• Reduction of workflow nets for generalised soundness verification
• Soundness and separability of workflow nets in the stepwise refinement approach
• Structural soundness of workflow nets is decidable
• The Reachability Problem for Petri Nets Is Not Elementary
• The covering and boundedness problems for vector addition systems
• The logical view on continuous Petri nets
• Unbounded-thread program verification using thread-state equations
• Verification of workflow nets
• Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations
• Verifying generalized soundness of workflow nets

Cited in

(12)

• Model checking workflow net based on Petri net
• scientific article; zbMATH DE number 1708021 (Why is no real title available?)
• Decidability of $$k$$-Soundness for Workflow Nets with an Unbounded Resource
• Applications and Theory of Petri Nets 2004
• Reduction of workflow nets for generalised soundness verification
• Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations
• Verifying generalized soundness of workflow nets
• Soundness and separability of workflow nets in the stepwise refinement approach
• An analytical method for well-formed workflow/Petri net verification of classical soundness
• Soundness of workflow nets: classification, decidability, and analysis
• Constraint Solving for Verifying Modal Specifications of Workflow Nets with Data
• Fast termination and workflow nets

This page was built for publication: Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487345)