Soundness and Separability of Workflow Nets in the Stepwise Refinement Approach
From MaRDI portal
Publication:3550623
DOI10.1007/3-540-44919-1_22zbMath1274.68263OpenAlexW1585036716MaRDI QIDQ3550623
K. M. van Hee, Marc Voorhoeve, Natalia Sidorova
Publication date: 31 March 2010
Published in: Applications and Theory of Petri Nets 2003 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-44919-1_22
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (9)
Sufficient conditions for the marked graph realisability of labelled transition systems ⋮ Aligning event logs to resource-constrained \(\nu \)-Petri nets ⋮ Data and process resonance. Identifier soundness for models of information systems ⋮ Correctness Notions for Petri Nets with Identifiers ⋮ Discovery, Verification and Conformance of Workflows with Cancellation ⋮ Refinement of Synchronizable Places with Multi-workflow Nets ⋮ Soundness of workflow nets: classification, decidability, and analysis ⋮ Compositional Service Trees ⋮ Structural soundness of workflow nets is decidable
Uses Software
This page was built for publication: Soundness and Separability of Workflow Nets in the Stepwise Refinement Approach
