Applications and Theory of Petri Nets 2004

DOI10.1007/b98283zbMath1094.68070DBLPconf/apn/2004OpenAlexW2495597431WikidataQ56892631 ScholiaQ56892631MaRDI QIDQ5712330

K. M. van Hee, Natalia Sidorova, Marc Voorhoeve

Publication date: 23 December 2005

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

Full work available at URL: https://doi.org/10.1007/b98283

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (10)

Decidability of $$k$$-Soundness for Workflow Nets with an Unbounded Resource ⋮ Sufficient and necessary condition to decide compatibility for a class of interorganizational workflow nets ⋮ PSPACE-Completeness of the Soundness Problem of Safe Asymmetric-Choice Workflow Nets ⋮ Reduction of Workflow Nets for Generalised Soundness Verification ⋮ Discovery, Verification and Conformance of Workflows with Cancellation ⋮ Refinement of Synchronizable Places with Multi-workflow Nets ⋮ Soundness of workflow nets: classification, decidability, and analysis ⋮ An analytical method for well-formed workflow/Petri net verification of classical soundness ⋮ Soundness-preserving reduction rules for reset workflow nets ⋮ Structural soundness of workflow nets is decidable

Uses Software

• Woflan

This page was built for publication: Applications and Theory of Petri Nets 2004