Soundness of workflow nets: classification, decidability, and analysis

From MaRDI portal

DOI10.1007/S00165-010-0161-4MaRDI QIDQ539433zbMATH OpenOpenAlexWikidataFDO

Authors K. M. van Hee, H. M. W. Verbeek, W. M. P. van der Aalst, Arthur H. M. ter Hofstede, Natalia Sidorova, Marc Voorhoeve, Moe Thandar Wynn

Publication date 30 May 2011

Published in Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00165-010-0161-4


zbMATH Keywords

decidabilityPetri netsreset netssoundnessverificationworkflow nets

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)




Review text

The workflow verification is an object of investigation since a few years. The WorkFlow Nets (WFNs) were introduced by the first author, W. M. P. van der Aalst, in 1997 as a particular case of Petri nets. In the following research of the same author it was shown that WFNs can be used as a tool for modelling and analysis of workflows. In the present research, important properties of WFNs, related to decidability and undecidability problems, are studied.


Recommendations


Cites work


Cited in
(63)


Describes a project that uses

Uses Software






This page was built for publication: Soundness of workflow nets: classification, decidability, and analysis

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Soundness_of_workflow_nets:_classification,_decidability,_and_analysis&oldid=62599302"
Powered by MediaWiki