Discovery, Verification and Conformance of Workflows with Cancellation

DOI10.1007/978-3-540-87405-8_2MaRDI QIDQ3540385zbMATH OpenOpenAlexWikidataFDO

Authors W. M. P. van der Aalst

Publication date 20 November 2008

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

Full work available at URL https://doi.org/10.1007/978-3-540-87405-8_2

zbMATH Keywords

verificationPetri netsprocess miningsoundnessreset nets

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Soundness-preserving reduction rules for reset workflow nets
• Soundness of workflow nets with reset ARCS
• Research on workflow model based on Petri net with reset arcs
• Discovery of cancellation regions within process mining techniques
• Soundness of workflow nets: classification, decidability, and analysis

Cites work

• scientific article; zbMATH DE number 3711390 (Why is no real title available?)
• scientific article; zbMATH DE number 1223710 (Why is no real title available?)
• scientific article; zbMATH DE number 1302048 (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?)
• scientific article; zbMATH DE number 1437942 (Why is no real title available?)
• Applications and Theory of Petri Nets 2004
• Applications and Theory of Petri Nets 2005
• Deriving Petri nets from finite transition systems
• Fundamental Approaches to Software Engineering
• Lectures on Concurrency and Petri Nets
• Process Discovery Using Integer Linear Programming
• Reduction rules for reset/inhibitor nets
• Soundness and separability of workflow nets in the stepwise refinement approach
• Soundness of workflow nets: classification, decidability, and analysis
• The synthesis problem for elementary net systems is NP-complete
• Well-structured transition systems everywhere!

Cited in

(7)

• Confusion analysis and detection for workflow nets
• Discovery of cancellation regions within process mining techniques
• Research on workflow model based on Petri net with reset arcs
• Compensation in Workflow Nets
• Soundness-preserving reduction rules for reset workflow nets
• Completeness in supergravity constructions
• Aggregating causal runs into workflow nets

This page was built for publication: Discovery, Verification and Conformance of Workflows with Cancellation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540385)