2009
DOI: 10.1016/j.is.2008.06.003
|View full text |Cite
|
Sign up to set email alerts
|

On the relationship between workflow models and document types

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2009
2009
2023
2023

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 17 publications
(6 citation statements)
references
References 28 publications
0
6
0
Order By: Relevance
“…We are also interested in "positive" patterns, which would allow us to lower the probabilistic bounds for nets matching these patterns, since our probabilistic bound can clearly be further lowered for some classes of nets. We also want to investigate the applicability of Bayesian methods for the log completeness problem APPENDIX In this final part we present a lemma and detailed derivation of (3), (11), (12) Note that we assume in an acyclic T-workflow net, choices of all the enabled transitions are made with equal probabilities. Therefore, a and b are simultaneously enabled if Z i (a, b) = {3, 4}, and one transition is chosen with probability 1 2 .…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…We are also interested in "positive" patterns, which would allow us to lower the probabilistic bounds for nets matching these patterns, since our probabilistic bound can clearly be further lowered for some classes of nets. We also want to investigate the applicability of Bayesian methods for the log completeness problem APPENDIX In this final part we present a lemma and detailed derivation of (3), (11), (12) Note that we assume in an acyclic T-workflow net, choices of all the enabled transitions are made with equal probabilities. Therefore, a and b are simultaneously enabled if Z i (a, b) = {3, 4}, and one transition is chosen with probability 1 2 .…”
Section: Discussionmentioning
confidence: 99%
“…First, we focus on the probabilistic bounds for log completeness obtained using Algorithm 2 both with formula (8) and with formula (10). We generate structured Jackson nets [11], which form a subset of sound workflow nets. We generated 100 structured Jackson nets, each with 30 transitions.…”
Section: A Bounds For Sound Workflow Netsmentioning
confidence: 99%
“…In the scientific workflow community, workflow design issues have received comparatively little attention in the past, but their importance is now more fully emerging [4,10,15,13,18,19,1,35]. In this paper, we have presented VDAL, a scientific workflow modeling and design paradigm for data assembly lines that aims at minimizing the "shimantic web syndrome" [16], i.e., the proliferation of unnecessarily complex workflow designs that involve large numbers of shim actors and "messy wiring", thus obfuscating the scientific protocol that the workflow should capture in the first place.…”
Section: Discussion and Related Workmentioning
confidence: 99%
“…We can obtain three synchronization processes S101, S211, S311 and three base processes B0, B101, B211. By applying the method that is mentioned by K. van Hee [2], the tree structures of the base processes and synchronization processes in Fig. 5 are respectively shown in Fig.…”
Section: Applied Mechanics and Mechatronics Automationmentioning
confidence: 99%
“…For example, tree structure is used to optimize the workflow process by J. Vanhatalo et al [1]. And K. van Hee et al [2] used a document type tree in workflow data model to study the integration of workflow process model and data model. W.M.P.…”
Section: Introductionmentioning
confidence: 99%