Soundness of workflow nets: classification, decidability, and analysis
From MaRDI portal
Publication:539433
DOI10.1007/s00165-010-0161-4zbMath1225.68129OpenAlexW2138447175WikidataQ57005245 ScholiaQ57005245MaRDI QIDQ539433
H. M. W. Verbeek, K. M. van Hee, Natalia Sidorova, Moe Thandar Wynn, Arthur H. M. ter Hofstede, Marc Voorhoeve, Wil M. P. van der Aalst
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
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
An approach based on timed Petri nets and tree encoding to implement search algorithms for a class of scheduling problems ⋮ Sufficient conditions for the marked graph realisability of labelled transition systems ⋮ Decidability of $$k$$-Soundness for Workflow Nets with an Unbounded Resource ⋮ Discovering workflow nets using integer linear programming ⋮ Model checking Petri nets with names using data-centric dynamic systems ⋮ Sufficient and necessary condition to decide compatibility for a class of interorganizational workflow nets ⋮ Data Centric Workflows for Crowdsourcing ⋮ PSPACE-Completeness of the Soundness Problem of Safe Asymmetric-Choice Workflow Nets ⋮ Reduction of Workflow Nets for Generalised Soundness Verification ⋮ Boundedness of adaptive nets is decidable ⋮ Optimal directed hypergraph traversal with ant-colony optimisation ⋮ Unnamed Item ⋮ Healthcare operation improvement based on simulation of cooperative resource preservation nets for none-consumable resources ⋮ Discovery, Verification and Conformance of Workflows with Cancellation ⋮ Associative composition of components with double-sided interfaces ⋮ Partial order reduction for checking soundness of time workflow nets ⋮ Aggregating Causal Runs into Workflow Nets ⋮ Free-choice Nets with Home Clusters are Lucent ⋮ Well-structuredness, safeness and soundness: a formal classification of BPMN collaborations ⋮ Soundness of Timed-Arc Workflow Nets ⋮ Unnamed Item ⋮ Complexity of the deadlock problem for Petri nets modeling resource allocation systems ⋮ Deciding the liveness for a subclass of weighted Petri nets based on structurally circular wait ⋮ A mathematical modelling for workflows ⋮ Causal Nets: A Modeling Language Tailored towards Process Discovery ⋮ Discovering Object-centric Petri Nets
Uses Software
Cites Work
- Reduction rules for reset/inhibitor nets
- Soundness-preserving reduction rules for reset workflow nets
- Reachability in live and safe free-choice Petri nets is NP-complete
- Liveness, fairness, and recurrence in Petri nets
- Diagnosing Workflow Processes using Woflan
- 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
- Branching time and abstraction in bisimulation semantics
- Free Choice Petri Nets
- Fundamental Approaches to Software Engineering
- Applications and Theory of Petri Nets 2004
- Applications and Theory of Petri Nets 2005
- Applications and Theory of Petri Nets 2005
- Well-structured transition systems everywhere!
- Petri net-based modelling of workflow systems: An overview
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
