Soundness of workflow nets: classification, decidability, and analysis
From MaRDI portal
Recommendations
- Structural soundness of workflow nets is decidable
- Applications and Theory of Petri Nets 2004
- Complexity of the soundness problem of workflow nets
- Verifying generalized soundness of workflow nets
- Applications and Theory of Petri Nets 2005
- Soundness and separability of workflow nets in the stepwise refinement approach
- Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations
- Complexity of the soundness problem of bounded workflow nets
- An analytical method for well-formed workflow/Petri net verification of classical soundness
Cites work
- scientific article; zbMATH DE number 1708021 (Why is no real title available?)
- scientific article; zbMATH DE number 2088769 (Why is no real title available?)
- scientific article; zbMATH DE number 1223710 (Why is no real title available?)
- scientific article; zbMATH DE number 1302047 (Why is no real title available?)
- scientific article; zbMATH DE number 1341758 (Why is no real title available?)
- scientific article; zbMATH DE number 1049168 (Why is no real title available?)
- scientific article; zbMATH DE number 827979 (Why is no real title available?)
- scientific article; zbMATH DE number 1405652 (Why is no real title available?)
- scientific article; zbMATH DE number 1416643 (Why is no real title available?)
- A Look Around the Corner: The Pi-Calculus
- Applications and Theory of Petri Nets 2004
- Applications and Theory of Petri Nets 2005
- Applications and Theory of Petri Nets 2005
- Branching time and abstraction in bisimulation semantics
- Diagnosing workflow processes using Woflan
- Free Choice Petri Nets
- Fundamental Approaches to Software Engineering
- Liveness, fairness, and recurrence in Petri nets
- Petri net-based modelling of workflow systems: An overview
- Property Specifications for Workflow Modelling
- Reachability in live and safe free-choice Petri nets is NP-complete
- Reduction rules for reset/inhibitor nets
- Soundness and separability of workflow nets in the stepwise refinement approach
- Soundness of workflow nets with reset ARCS
- Soundness-preserving reduction rules for reset workflow nets
- Well-structured transition systems everywhere!
Cited in
(63)- scientific article; zbMATH DE number 7447773 (Why is no real title available?)
- Acyclic Petri and workflow nets with resets
- Model checking workflow net based on Petri net
- Healthcare operation improvement based on simulation of cooperative resource preservation nets for none-consumable resources
- scientific article; zbMATH DE number 2088769 (Why is no real title available?)
- Complexity of the deadlock problem for Petri nets modeling resource allocation systems
- Decidability of k-Soundness for Workflow Nets with an Unbounded Resource
- Aggregating causal runs into workflow nets
- Soundness of reset workflow nets
- Verification of workflow nets
- Well-structuredness, safeness and soundness: a formal classification of BPMN collaborations
- Discovering object-centric Petri nets
- Applications and Theory of Petri Nets 2004
- Applications and Theory of Petri Nets 2005
- Can I find a partner? Undecidability of partner existence for open nets
- Applications of propositional logic to workflow analysis
- Sufficient conditions for the marked graph realisability of labelled transition systems
- Data centric workflows for crowdsourcing
- Structural soundness of workflow nets is decidable
- Safety and Soundness for Priced Resource-Constrained Workflow Nets
- Reduction of workflow nets for generalised soundness verification
- Diagnostic information for control-flow analysis of workflow graphs (a.k.a. free-choice workflow nets)
- Soundness of timed-arc workflow nets
- An approach based on timed Petri nets and tree encoding to implement search algorithms for a class of scheduling problems
- Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations
- On soundness for time workflow nets
- Soundness of workflow nets with reset ARCS
- Discovering workflow nets using integer linear programming
- Verifying generalized soundness of workflow nets
- Soundness and separability of workflow nets in the stepwise refinement approach
- Complexity of the soundness problem of bounded workflow nets
- Complexity of the soundness problem of workflow nets
- WRI WF-net: verification and implementation
- Object-Centric Process Mining: Dealing with Divergence and Convergence in Event Data
- Model checking Petri nets with names using data-centric dynamic systems
- On Determining the AND-OR Hierarchy in Workflow Nets
- An analytical method for well-formed workflow/Petri net verification of classical soundness
- Deciding the liveness for a subclass of weighted Petri nets based on structurally circular wait
- Soundness of timed-arc workflow nets in discrete and continuous-time semantics
- Applications and Theory of Petri Nets 2005
- Sufficient and necessary condition to decide compatibility for a class of interorganizational workflow nets
- Causal nets: a modeling language tailored towards process discovery
- Connectivity of workflow nets: The foundations of stepwise verification
- Checking properties of adaptive workflow nets
- PSPACE-completeness of the soundness problem of safe asymmetric-choice workflow nets
- Boundedness of adaptive nets is decidable
- An algebraic analysis of workflows
- The complexity of soundness in workflow nets
- Confusion analysis and detection for workflow nets
- Free-choice Nets with Home Clusters are Lucent
- Discovery, Verification and Conformance of Workflows with Cancellation
- A mathematical modelling for workflows
- Polynomial analysis algorithms for free choice probabilistic workflow nets
- Compositional separation of control flow and data flow
- Partial order reduction for checking soundness of time workflow nets
- Soundness in negotiations
- Interacting workflow nets for workflow process re-engineering
- On generating hierarchical workflow nets and their extensions and verifying hierarchicality
- Fast termination and workflow nets
- There and back again. On the reconstructability and rediscoverability of typed Jackson nets
- Associative composition of components with double-sided interfaces
- Optimal directed hypergraph traversal with ant-colony optimisation
- Soundness verification of data-aware process models with variable-to-variable conditions
This page was built for publication: Soundness of workflow nets: classification, decidability, and analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q539433)
