Abstract
Workflow nets are recognized as a modelling paradigm for the business process modelling. We introduce and investigate several correctness notions for workflow nets, ranging from proper termination of cases to their mutual independence. We define refinement operators for nets and investigate preservation of correctness through these operators. This gives rise to a class of nets that are provably correct. © Springer-Verlag Berlin Heidelberg 2003.
Author supplied keywords
Cite
CITATION STYLE
Van Hee, K., Sidorova, N., & Voorhoeve, M. (2003). Soundness and separability of workflow nets in the stepwise refinement approach. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2679, 337–356. https://doi.org/10.1007/3-540-44919-1_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
