1998
DOI: 10.1023/a:1008608810770
|View full text |Cite
|
Sign up to set email alerts
|

Untitled

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
12
0

Year Published

2003
2003
2015
2015

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 155 publications
(12 citation statements)
references
References 22 publications
0
12
0
Order By: Relevance
“…Finally, Muth et al [50] use the formal semantics of state/activity charts to develop an algorithm for transforming centralized state/activity charts into equivalent partitioned ones, suitable for distributed execution by a workflow engine. Muth et al subsequently refine their basic approach to also reducing communication overhead and exploiting parallelism between parts in partitions.…”
Section: Distributed Orchestration/workflowmentioning
confidence: 99%
“…Finally, Muth et al [50] use the formal semantics of state/activity charts to develop an algorithm for transforming centralized state/activity charts into equivalent partitioned ones, suitable for distributed execution by a workflow engine. Muth et al subsequently refine their basic approach to also reducing communication overhead and exploiting parallelism between parts in partitions.…”
Section: Distributed Orchestration/workflowmentioning
confidence: 99%
“…State charts [5], Petri nets [6], and activity diagrams [7] have been utilized by many studies. Issues of intuitiveness, ease, and rigorousness of semantics are discussed repeatedly in these works.…”
Section: Related Workmentioning
confidence: 99%
“…The static temporal constraint of a(i) is represented as d a (i) = TAU 1 (m a (i), M a (i)); (2) a( j) is the direct preceding activity of a(i) and its actual execution duration is E a ( j). The temporal constraints between activity a(i) and a( j) is d a ( j, i) = TAU 2 (s a ( j, i), e a ( j, i)); (3) a(k) is the direct subsequent activity of a(i) and its static temporal constraints is d a (k) = TAU 3 (m a (k), M a (k)). The temporal constraints between activity a(k) and a(i) is d a (i, k) = TAU 4 (s a (i, k), e a (i, k)).…”
Section: Dynamic Temporal Constraints Analysismentioning
confidence: 99%
“…Distributed workflow management system (DWfS) is one of the strong and useful tools to model and enact business and scientific collaboration processes as well as distributed and heterogeneous system integration. Thus, it is studied widely in academe and industrial groups [1][2][3][4][5]. Grid computing is a new kind of concept and methodology for building distributed computing platforms across different virtual organizations [6], among which Grid workflow technology plays one of the fundamental roles.…”
Section: Introductionmentioning
confidence: 99%