Verification of workflow nets

DOI10.1007/3-540-63139-9_48MaRDI QIDQ6485727zbMATH OpenWikidataFDO

Authors W. M. P. van der Aalst

Publication date 9 December 2022

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

Full work available at URL https://doi.org/10.1007/3-540-63139-9_48

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) Theory of organizations, manpower planning in operations research (90B70)

Recommendations

• scientific article; zbMATH DE number 2115942
• Verification of workflow task structures: A Petri-net-based approach
• Using pre-estimate with feedback for adaptation Web server QoS guarantee
• Soundness of workflow nets: classification, decidability, and analysis
• scientific article; zbMATH DE number 2204026

Cited in

(22)

• Verification of workflow task structures: A Petri-net-based approach
• Data and process resonance. Identifier soundness for models of information systems
• Confusion analysis and detection for workflow nets
• Automatic workflow verification and generation
• Diagnosing workflow processes using Woflan
• scientific article; zbMATH DE number 1696472 (Why is no real title available?)
• Constraint Solving for Verifying Modal Specifications of Workflow Nets with Data
• Verification problems in conceptual workflow specifications
• scientific article; zbMATH DE number 1949602 (Why is no real title available?)
• scientific article; zbMATH DE number 2115942 (Why is no real title available?)
• scientific article; zbMATH DE number 2202204 (Why is no real title available?)
• scientific article; zbMATH DE number 2204026 (Why is no real title available?)
• Inheritance of behavior
• Task net: Transactional workflow model based on colored Petri net.
• Verifying Generalised and Structural Soundness of Workflow Nets via Relaxations
• There and back again. On the reconstructability and rediscoverability of typed Jackson nets
• Fast termination and workflow nets
• The complexity of soundness in workflow nets
• Confluence for process verification
• Coverability in VASS revisited: improving Rackoff's bounds to obtain conditional optimality
• Monus semantics in vector addition systems with states
• Soundness of reset workflow nets

This page was built for publication: Verification of workflow nets

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