Download now Free registration required
The iTask system is an easy to use combinator library for specifying dynamic data dependent workflows in a very flexible way. The specified workflows are executed as a multi-user web-application. The implementation of the iTask system is fairly complicated. Hence the authors cannot use it for reasoning about the semantics of workflows in the iTask system. In this paper, they define an executable semantics that specifies how workflows react on events generated by the workers executing them. The semantics is used to explain iTasks and to reason about iTasks. Based on this semantics they define a mathematical notion of equivalence of tasks and show how this equivalence for tasks can be approximated automatically.
- Format: PDF
- Size: 215.6 KB