Sufficient and necessary condition to decide compatibility for a class of interorganizational workflow nets
From MaRDI portal
Publication:1665580
Recommendations
Cites work
- scientific article; zbMATH DE number 1445908 (Why is no real title available?)
- Applications and Theory of Petri Nets 2004
- Complexity of the soundness problem of workflow nets
- Compositional semantics for open Petri nets based on deterministic processes
- Formal methods for web services. 9th international school on formal methods for the design of computer, communication, and software systems, SFM 2009, Bertinoro, Italy, June 1--6, 2009. Advanced lectures
- Free Choice Petri Nets
- Soundness of workflow nets: classification, decidability, and analysis
- Structural soundness of workflow nets is decidable
- The ePNK: an extensible Petri net tool for PNML
- Understanding Petri Nets
Cited in
(3)
This page was built for publication: Sufficient and necessary condition to decide compatibility for a class of interorganizational workflow nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1665580)