Discovery, Verification and Conformance of Workflows with Cancellation

DOI10.1007/978-3-540-87405-8_2zbMath1175.68283OpenAlexW2104195719WikidataQ57005662 ScholiaQ57005662MaRDI QIDQ3540385

Wil 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 netssoundnessprocess miningreset nets

Mathematics Subject Classification ID

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

Related Items

Completeness in supergravity constructions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Soundness of workflow nets: classification, decidability, and analysis
• Reduction rules for reset/inhibitor nets
• The synthesis problem for elementary net systems is NP-complete
• Process Discovery Using Integer Linear Programming
• Soundness and Separability of Workflow Nets in the Stepwise Refinement Approach
• Deriving Petri nets from finite transition systems
• Fundamental Approaches to Software Engineering
• Lectures on Concurrency and Petri Nets
• Applications and Theory of Petri Nets 2004
• Applications and Theory of Petri Nets 2005
• Well-structured transition systems everywhere!