Connectivity of workflow nets: The foundations of stepwise verification

DOI10.1007/s00236-011-0137-8zbMath1234.68305OpenAlexW2011512582MaRDI QIDQ766173

Matthias Weidlich, Mathias Weske, Artem Polyvyanyy

Publication date: 23 March 2012

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11343/224167

zbMATH Keywords

graph connectivitybehavioral modelsworkflow netsstepwise decomposition

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Connectivity (05C40)

Related Items

Associative composition of components with double-sided interfaces, Connectivity of workflow nets: The foundations of stepwise verification

Uses Software

• Mathematica
• BPEL2oWFN
• Woflan
• Algorithm 447

Cites Work

• Connectivity of workflow nets: The foundations of stepwise verification
• Reduction rules for reset/inhibitor nets
• Soundness-preserving reduction rules for reset workflow nets
• Analysis of Petri nets by stepwise refinements
• Fundamentals of control flow in workflows
• Diagnosing Workflow Processes using Woflan
• Efficient Computation of Causal Behavioural Profiles Using Structural Decomposition
• Dividing a Graph into Triconnected Components
• Free Choice Petri Nets
• Depth-First Search and Linear Graph Algorithms
• Inheritance of workflows: An approach to tackling problems related to change
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item