You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
While the paper describes a simple graph, like A -> B -> C -> A, etc., it would be useful to expand the graph (TODO: search for papers on this!).
Most workflow managers consider the nodes in the graph as tasks. And tasks can have statuses. The graph does not have exactly nodes and vertices such as A -> B. In reality, it is more like A:success -> B:success; A:failure -> B:failure; A:any -> B:any, and so it goes.
Perhaps the default value, if none other specified, should be :any -> :any. But if the user defines constraints such as statuses, then instead of having a Task (which is a graph node) with statuses, we could instead create a graph where the status becomes a node too.
This would probably be easier to use with the decyclify algorithm.
The text was updated successfully, but these errors were encountered:
While the paper describes a simple graph, like
A -> B -> C -> A
, etc., it would be useful to expand the graph (TODO: search for papers on this!).Most workflow managers consider the nodes in the graph as tasks. And tasks can have statuses. The graph does not have exactly nodes and vertices such as
A -> B
. In reality, it is more likeA:success -> B:success; A:failure -> B:failure; A:any -> B:any
, and so it goes.Perhaps the default value, if none other specified, should be
:any -> :any
. But if the user defines constraints such as statuses, then instead of having aTask
(which is a graph node) with statuses, we could instead create a graph where the status becomes a node too.This would probably be easier to use with the decyclify algorithm.
The text was updated successfully, but these errors were encountered: