Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations
From MaRDI portal
Publication:6487345
DOI10.1007/978-3-031-13188-2_23zbMATH Open1514.68123MaRDI QIDQ6487345FDOQ6487345
Authors: Michael Blondin, Filip Mazowiecki, Philip Offtermatt 
Publication date: 7 December 2022
Recommendations
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)
Cites Work
- Free Choice Petri Nets
- The covering and boundedness problems for vector addition systems
- Title not available (Why is that?)
- Complexity analysis of continuous Petri nets
- Fundamentals of control flow in workflows
- Structural soundness of workflow nets is decidable
- Diagnosing workflow processes using Woflan
- Verifying generalized soundness of workflow nets
- Soundness and separability of workflow nets in the stepwise refinement approach
- Applications and Theory of Petri Nets 2004
- Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations
- Verification of workflow nets
- The Reachability Problem for Petri Nets Is Not Elementary
- Diagnostic information for control-flow analysis of workflow graphs (a.k.a. free-choice workflow nets)
- The logical view on continuous Petri nets
- Context-free commutative grammars with integer counters and resets
- Unbounded-thread program verification using thread-state equations
- An SMT-based approach to coverability analysis
- Title not available (Why is that?)
- Reduction of workflow nets for generalised soundness verification
Cited In (12)
- Model checking workflow net based on Petri net
- Title not available (Why is that?)
- 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)
