Soundness of workflow nets: classification, decidability, and analysis
From MaRDI portal
Publication:539433
DOI10.1007/S00165-010-0161-4zbMATH Open1225.68129OpenAlexW2138447175WikidataQ57005245 ScholiaQ57005245MaRDI QIDQ539433FDOQ539433
Authors: K. M. van Hee, H. M. W. Verbeek, W. M. P. van der Aalst, Arthur H. M. ter Hofstede, Natalia Sidorova, Marc Voorhoeve, Moe Thandar Wynn 
Publication date: 30 May 2011
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00165-010-0161-4
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
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Free Choice Petri Nets
- Branching time and abstraction in bisimulation semantics
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Well-structured transition systems everywhere!
- Applications and Theory of Petri Nets 2005
- Title not available (Why is that?)
- Fundamental Approaches to Software Engineering
- Soundness-preserving reduction rules for reset workflow nets
- Title not available (Why is that?)
- Reachability in live and safe free-choice Petri nets is NP-complete
- Liveness, fairness, and recurrence in Petri nets
- Diagnosing workflow processes using Woflan
- Title not available (Why is that?)
- Title not available (Why is that?)
- Soundness and separability of workflow nets in the stepwise refinement approach
- Property Specifications for Workflow Modelling
- A Look Around the Corner: The Pi-Calculus
- Soundness of workflow nets with reset ARCS
- Title not available (Why is that?)
- Applications and Theory of Petri Nets 2004
- Applications and Theory of Petri Nets 2005
- Petri net-based modelling of workflow systems: An overview
- Reduction rules for reset/inhibitor nets
Cited In (60)
- The complexity of soundness in workflow nets
- Title not available (Why is that?)
- Model checking workflow net based on Petri net
- Title not available (Why is that?)
- Healthcare operation improvement based on simulation of cooperative resource preservation nets for none-consumable resources
- 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
- Verification of workflow nets
- Discovering object-centric Petri nets
- Well-structuredness, safeness and soundness: a formal classification of BPMN collaborations
- 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
- Data centric workflows for crowdsourcing
- Sufficient conditions for the marked graph realisability of labelled transition systems
- Safety and Soundness for Priced Resource-Constrained Workflow Nets
- Structural soundness of workflow nets is decidable
- 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
- Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations
- An approach based on timed Petri nets and tree encoding to implement search algorithms for a class of scheduling problems
- On soundness for time workflow nets
- Soundness of workflow nets with reset ARCS
- Verifying generalized soundness of workflow nets
- Soundness and separability of workflow nets in the stepwise refinement approach
- Discovering workflow nets using integer linear programming
- 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
- On Determining the AND-OR Hierarchy in Workflow Nets
- An analytical method for well-formed workflow/Petri net verification of classical soundness
- Model checking Petri nets with names using data-centric dynamic systems
- 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
- Checking properties of adaptive workflow nets
- Connectivity of workflow nets: The foundations of stepwise verification
- PSPACE-completeness of the soundness problem of safe asymmetric-choice workflow nets
- An algebraic analysis of workflows
- Boundedness of adaptive nets is decidable
- Free-choice Nets with Home Clusters are Lucent
- Confusion analysis and detection for workflow nets
- Discovery, Verification and Conformance of Workflows with Cancellation
- A mathematical modelling for workflows
- Polynomial analysis algorithms for free choice probabilistic workflow nets
- Soundness in negotiations
- Partial order reduction for checking soundness of time workflow nets
- 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
- Soundness verification of data-aware process models with variable-to-variable conditions
- Associative composition of components with double-sided interfaces
- Optimal directed hypergraph traversal with ant-colony optimisation
Uses Software
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)
