Reduction of Workflow Nets for Generalised Soundness Verification

DOI10.1007/978-3-319-52234-0_6zbMath1484.68139OpenAlexW2571306677MaRDI QIDQ2961558

Fabien Peureux, Hadrien Bride, Olga Kouchnarenko

Publication date: 21 February 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-52234-0_6

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Uses Software

• PNML
• SPIN
• Woflan
• VipTool
• Yasper
• PIPE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Soundness of workflow nets: classification, decidability, and analysis
• Soundness-preserving reduction rules for reset workflow nets
• A method for stepwise refinement and abstraction of Petri nets
• Fundamentals of control flow in workflows
• Reduction rules for time Petri nets
• Diagnosing Workflow Processes using Woflan
• Verifying Generalized Soundness of Workflow Nets
• Free Choice Petri Nets
• The Petri Net Markup Language
• Applications and Theory of Petri Nets 2004

This page was built for publication: Reduction of Workflow Nets for Generalised Soundness Verification